The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Behavior protocols for software components
Abstract
In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to express the "interplay" on the component's interfaces and reflect step-by-step refinement of the component's specification during its design. In addition, the notation should be easy to comprehend and allow for formal reasoning about the correctness of the specification refinement and also about the correctness of an implementation in terms of whether it adheres to the specification. Targeting all these requirements together, the paper proposes employing behavior protocols which are based on a notation similar to regular expressions. As proof of the concept, the behavior protocols are used in the SOFA architecture description language at three levels: interface, frame, and architecture. Key achievements of this paper include the definitions of bounded component behavior and protocol conformance relation. Using these concepts, the designer can verify the adherence of a component's implementation to its specification at runtime, while the correctness of refining the specification can be verified at design time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
A Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
Component software beyond object oriented programming
Szyperski, C., Gruntz, D., & Murer, S. 1. (2002) · Cited by 4,633
A classification and comparison framework for software architecture description languages
Medvidovic, N., & Taylor, R. N. (2000) · IEEE Transactions on Software Engineering · doi:10.1109/32.825767 · Cited by 1,987
A formal basis for architectural connection
Allen, R., & Garlan, D. (1997) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/258077.258078 · Cited by 1,253
de Alfaro, L., & Henzinger, T. A. (2001) · Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/503209.503226 · Cited by 1,171
Specification and analysis of system architecture using Rapide
Luckham, D. C., Kenney, J. J., Augustin, L. M., Vera, J., Bryan, D., & Mann, W. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.385971 · Cited by 766
A Formal Approach to Software Architectures
Allen, R. J., & Garlan, D. (1992) · World Computer Congress on Algorithms, Software, Architecture · Cited by 531
The specification of process synchronization by path expressions
Campbell, R. H., & Habermann, A. N. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0029355 · Cited by 448
Metadata
- Authors
- Plasil, F., & Visnovsky, S.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2002-11
- Volume
- 28
- Issue
- 11
- Pages
- 1056-1076
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W2137948900
- Cited by
- 346
- References
- 16
- FWCI
- 24.09
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Behavior protocols for software components. https://app.cochat.ai/papers/10.1109/tse.2002.1049404
- The paper
- Plasil, F., & Visnovsky, S. (2002). Behavior protocols for software components. IEEE Transactions on Software Engineering. https://doi.org/10.1109/tse.2002.1049404
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
