The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Automated consistency checking of requirements specifications
Abstract
This article describes a formal analysis technique, called consistency checking , for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed in the SCR (Software Cost Reduction) tabular notation. As background, the SCR approach to specifying requirements is reviewed. To provide a formal semantics for the SCR notation and a foundation for consistency checking, a formal requirements model is introduced; the model represents a software system as a finite-state automation which produces externally visible outputs in response to changes in monitored environmental quantities. Results of two experiments are presented which evaluated the utility and scalability of our technique for consistency checking in real-world avionics application. The role of consistency checking during the requirements phase of software development is discussed.
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
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
Software Engineering Economics
Boehm, B. W. (2001) · Pioneers and Their Contributions to Software Engineering · doi:10.1007/978-3-642-48354-7_5 · Cited by 5,981
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
The Esterel synchronous programming language: design, semantics, implementation
Berry, G., & Gonthier, G. (1992) · Science of Computer Programming · doi:10.1016/0167-6423(92)90005-v · Cited by 1,739
Smullyan, R. M. (1968) · Springer eBooks · doi:10.1007/978-3-642-86718-7 · Cited by 1,357
A rational design process: How and why to fake it
Parnas, D. L., & Clements, P. C. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312940 · Cited by 617
Requirements specification for process-control systems
Leveson, N. G., Heimdahl, M. P. E., Hildreth, H., & Reese, J. D. (1994) · IEEE Transactions on Software Engineering · doi:10.1109/32.317428 · Cited by 556
Cited by
Requirements engineering: a roadmap
Nuseibeh, B., & Easterbrook, S. (2000) · Proceedings of the Conference on The Future of Software Engineering · doi:10.1145/336512.336523 · Cited by 1,830
Requirements engineering in the year 00: a research perspective
van Lamsweerde, A. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337184 · Cited by 671
Handling obstacles in goal-oriented requirements engineering
van Lamsweerde, A., & Letier, E. (2000) · IEEE Transactions on Software Engineering · doi:10.1109/32.879820 · Cited by 648
Generating statechart designs from scenarios
Whittle, J., & Schumann, J. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337217 · Cited by 358
Assuring the Machine Learning Lifecycle: Desiderata, Methods, and Challenges
Ashmore, R., Calinescu, R., & Paterson, C. (2022) · ACM Computing Surveys · doi:10.1145/3453444 · Cited by 256
Metadata
- Authors
- Heitmeyer, C. L., Jeffords, R. D., & Labaw, B. G.
- Venue
- ACM Transactions on Software Engineering and Methodology
- Published
- 1996-07
- Volume
- 5
- Issue
- 3
- Pages
- 231-261
- ISSN
- 1049-331X (ISSN-L)
- 1557-7392
- OpenAlex
- W2125708466
- Cited by
- 605
- References
- 19
- FWCI
- 28.84
- 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: Automated consistency checking of requirements specifications. https://app.cochat.ai/papers/10.1145/234426.234431
- The paper
- Heitmeyer, C. L., Jeffords, R. D., & Labaw, B. G. (1996). Automated consistency checking of requirements specifications. ACM Transactions on Software Engineering and Methodology. https://doi.org/10.1145/234426.234431
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.