The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Formal methods: state of the art and future directions
Open accessAbstract
this report assesses the state of the art in specification and verification. For verification, we highlight advances in model checking and theorem proving. In the three sections on specification, model checking, and theorem proving, we explain what we mean by the general technique and briefly describe some successful case studies and well-known tools. The second part of this report outlines future directions in fundamental concepts, new methods and tools, integration of methods, and education and technology transfer. We close with summary remarks and pointers to resources for more information
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
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
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
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
A Calculus of Communicating Systems
(1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10235-3 · Cited by 4,633
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
Self-citationThe Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
Design and validation of computer protocols
Holzmann, G. J. (1991) · Cited by 1,926
Systematic software development using VDM
Jones, C. B. (1986) · Prentice Hall International (UK) Ltd. eBooks · Cited by 1,715
McMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
The temporal semantics of concurrent programs
Pnueli, A. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90110-9 · Cited by 699
Gordon, M. J., Milner, A. J., & Wadsworth, C. P. (1979) · Lecture Notes in Computer Science · doi:10.1007/3-540-09724-4 · Cited by 628
Symbolic model checking for sequential circuit verification
Burch, J. R., Clarke, E. M., Long, D. E., McMillan, K. L., & Dill, D. L. (1994) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.275352 · Cited by 547
Self-citationSpecifying Software Requirements for Complex Systems: New Techniques and Their Application
Heninger, K. L. (1980) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1980.230208 · Cited by 493
Computer-Aided Verification of Coordinating Processes
Kurshan, R. P. (1995) · Princeton University Press eBooks · doi:10.1515/9781400864041 · Cited by 440
Kapur, D., & Musser, D. R. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90017-8 · Cited by 122
Automated proofs of object code for a widely used microprocessor
Boyer, R. S., & Yu, Y. (1996) · Journal of the ACM · doi:10.1145/227595.227603 · Cited by 118
Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93
(1993) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd.1993.393415 · Cited by 103
1983 IEEE Symposium on Security and Privacy
(1983) · doi:10.1109/sp.1983 · Cited by 58
A formal approach to reactive systems software: A telecommunications application in Esterel
Jategaonkar, L., Puchol, C., & Olnhausen, J. E. V. (1996) · Formal Methods in System Design · doi:10.1007/bf00122418 · Cited by 35
The symbolic model-checking for real-time systems
Yamane, S. (2002) · Proceedings - Euromicro Workshop on Real-Time Systems/Proceedings · doi:10.1109/emwrts.1996.557829 · Cited by 16
Cited by
Dynamically discovering likely program invariants to support program evolution
Ernst, M. D., Cockrell, J., Griswold, W. G., & Notkin, D. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.908957 · Cited by 1,050
Formal methods: Practice and experience
Woodcock, J., Larsen, P. G., Bicarregui, J., & Fitzgerald, J. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592436 · Cited by 686
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
“It is also worth noting the recent trend of the intersection of certiied robustness and the perspective of formal veriication, which aims at developing rigorous mathematical speciication and techniques of veriication for assurances of software correctness [83].”
BackgroundUsing simplicity to control complexity
Sha, L. (2001) · IEEE Software · doi:10.1109/ms.2001.936213 · Cited by 420
Using formal specifications to support testing
Hierons, R. M., Bogdanov, K., Bowen, J. P., Cleaveland, R., Derrick, J., Dick, J., Gheorghe, M., Harman, M., Kapoor, K., Krause, P., et al. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459354 · Cited by 356
Metadata
- Authors
- Clarke, E. M., & Wing, J. M.
- Venue
- ACM Computing Surveys
- Published
- 1996-12
- Volume
- 28
- Issue
- 4
- Pages
- 626-643
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W4296471858
- Cited by
- 763
- References
- 21
- FWCI
- 17.01
- Type
- journal article
- Language
- en
- Open access
- bronze
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.