The DOI matches its OpenAlex record; 32 of the 32 references it cites were found in a registry or an index.
Formal Methods: State of the Art and Future Directions
Open accessAbstract
Hardware and software systems will inevitably grow in scale and functionality. Because of this increase in complexity, the likelihood of subtle errors is much greater. Moreover, some of these errors may cause catastrophic loss of money, time, or even human life. A major goal of software engineering is to enable developers to construct systems that operate reliably despite this complexity. One way of achieving this goal is by using formal methods, which are mathematically based languages, techniques, and tools for specifying and verifying such systems. Use of formal methods does not a priori guarantee correctness. However, they can greatly increase our understanding of a system by revealing inconsistencies, ambiguities, and incompleteness that might otherwise go undetected. The first part of 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
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
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
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
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
Self-citationDesign 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
Self-citationDesign and validation of computer protocols
Holzmann, G. J. (1991) · Cited by 1,926
Lamport, L. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177726 · Cited by 1,843
Systematic software development using VDM
Jones, C. B. (1986) · Prentice Hall International (UK) Ltd. eBooks · Cited by 1,715
Self-citationParallel Program Design: A Foundation
Chandy, K. M. (1988) · Medical Entomology and Zoology · Cited by 1,539
PVS: A prototype verification system
Owre, S., Rushby, J. M., & Shankar, N. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55602-8_217 · Cited by 1,415
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
Symbolic model checking: an approach to the state explosion problem
McMillan, K. L. (1992) · Defense Technical Information Center (DTIC) · Cited by 979
The Coq Proof Assistant - Reference Manual Version 6.1
Filliâtre, J.-C., Herbelin, H., Barras, B., Boutin, S., Giménez, E., Huet, G., Munoz, C. A., Cornes, C., Cornes, C., Courant, J., et al. (1997) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 979
Boyer, R. S., & Moore, J. S. (1979) · Cited by 883
Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR
Lowe, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61042-1_43 · Cited by 872
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
The temporal semantics of concurrent programs
Pnueli, A. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90110-9 · Cited by 699
Larch: Languages and Tools for Formal Specification
Guttag, J. V., Horning, J. J., Garland, S. J., Jones, K. D., Modet, A., & Wing, J. M. (1993) · Springer eBooks · doi:10.1007/978-1-4612-2704-5 · Cited by 618
Self-citationVIS: A system for verification and synthesis
Brayton, R. K., Hachtel, G. D., Sangiovanni-Vincentelli, A., Somenzi, F., Aziz, A., Cheng, S. T., Edwards, S., Khatri, S., Kukimoto, Y., Pardo, A., et al. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_95 · Cited by 608
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
Model checking and abstraction
Clarke, E. M., Grümberg, O., & Long, D. E. (1992) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/143165.143235 · Cited by 352
Self-citationAn integration of model checking with automated proof checking
Rajan, S. P., Shankar, N., & Srivas, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60045-0_42 · Cited by 179
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
The Theory and Practice of A Formal Method: NewCoRe.
Holzmann, G. J. (1994) · IFIP Congress · Cited by 48
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
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
Using simplicity to control complexity
Sha, L. (2001) · IEEE Software · doi:10.1109/ms.2001.936213 · Cited by 420
HCI Models, Theories, and Frameworks
(2003) · Elsevier eBooks · doi:10.1016/b978-1-55860-808-5.x5000-x · Cited by 373
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., Wing, J. M., & Jones, C. B.
- Published
- 1996-01-01
- OpenAlex
- W2034717157
- Cited by
- 1,122
- References
- 32
- FWCI
- 42.77
- Type
- journal article
- Language
- en
- Open access
- green
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.