The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
The model checker SPIN
Abstract
SPIN is an efficient verification system for models of distributed software systems. It has been used to detect design errors in applications ranging from high-level descriptions of distributed algorithms to detailed code for controlling telephone exchanges. The paper gives an overview of the design and structure of the verifier, reviews its theoretical foundation, and gives an overview of significant practical applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
Design and validation of computer protocols
Holzmann, G. J. (1991) · Cited by 1,926
Self-citationMcMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
Specification and verification of concurrent systems in CESAR
Queille, J. P., & Sifakis, J. (1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11494-7_22 · Cited by 1,321
An Automata-Theoretic Approach to Automatic Program Verification
Vardi, M. Y., & Wolper, P. (1986) · ORBi (University of Liège) · Cited by 1,261
Reasoning about Infinite Computations
Vardi, M. Y., & Wolper, P. (1994) · Information and Computation · doi:10.1006/inco.1994.1092 · Cited by 795
Computer-aided verification of coordinating processes: The automata-theoretic approach
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90267-8 · Cited by 786
Simple On-the-fly Automatic Verification of Linear Temporal Logic
Gerth, R., Peled, D., Vardi, M. Y., & Wolper, P. (1996) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-34892-6_1 · Cited by 705
An automata-theoretic approach to linear temporal logic
Vardi, M. Y. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60915-6_6 · Cited by 660
Memory-efficient algorithms for the verification of temporal properties
Courcoubetis, C., Vardi, M., Wolper, P., & Yannakakis, M. (1992) · Formal Methods in System Design · doi:10.1007/bf00121128 · Cited by 501
Computer-Aided Verification of Coordinating Processes
Kurshan, R. P. (1995) · Princeton University Press eBooks · doi:10.1515/9781400864041 · Cited by 440
Specification and Verification of Concurrent Systems
Rattray, C. (1990) · Workshops in computing · doi:10.1007/978-1-4471-3534-0 · Cited by 233
Xtp: The Xpress Transfer Protocol
Strayer, W. T., Dempsey, B. J., & Weaver, A. C. (1992) · Medical Entomology and Zoology · Cited by 175
Algorithms for Automated Protocol Verification
Holzmann, G. J. (1990) · AT&T Technical Journal · doi:10.1002/j.1538-7305.1990.tb00101.x · Cited by 89
Self-citationThe Theory and Practice of A Formal Method: NewCoRe.
Holzmann, G. J. (1994) · IFIP Congress · Cited by 48
Self-citation
Cited by
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
Cadar, C., Dunbar, D., & Engler, D. (2008) · doi:10.5555/1855741.1855756 · Cited by 2,620
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
Alternating-time temporal logic
Alur, R., Henzinger, T. A., & Kupferman, O. (2002) · Journal of the ACM · doi:10.1145/585265.585270 · Cited by 1,394
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
The oracle problem in software testing: A survey
Barr, E. T., Harman, M., McMinn, P., Shahbaz, M., & Yoo, S. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2014.2372785 · Cited by 1,104
Metadata
- Authors
- Holzmann, G. J.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1997-05
- Volume
- 23
- Issue
- 5
- Pages
- 279-295
- ISSN
- 0098-5589 (ISSN-L)
- 1939-3520
- 2326-3881
- OpenAlex
- W2115309705
- Cited by
- 3,803
- References
- 19
- FWCI
- 105.83
- 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
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.