A Survey of Automated Techniques for Formal Software Verification
The DOI matches its Crossref record; 77 of the 77 references it cites were found in a registry or an index.
Abstract
The quality and the correctness of software are often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific flaws. This paper surveys algorithms that perform automatic static analysis of software to detect programming errors or prove their absence. The three techniques considered are static analysis with abstract domains, model checking, and bounded model checking. A short tutorial on these techniques is provided, highlighting their differences when applied to practical problems. This paper also surveys tools implementing these techniques and describes their merits and shortcomings.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
Chaff: engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.379017 · Cited by 2,940
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
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
Symbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clarke, E., & Zhu, Y. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49059-0_14 · Cited by 2,150
The B-book: assigning programs to meanings
(1997) · Choice Reviews Online · doi:10.5860/choice.34-3906 · Cited by 2,106
Counterexample-Guided Abstraction Refinement
Clarke, E., Grumberg, O., Jha, S., Lu, Y., & Veith, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722167_15 · Cited by 1,702
The B-Book: Assigning Programs to Meanings
Abrial, J. R., Hoare, A., & Chapron, P. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624162 · Cited by 1,700
McMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
Systematic design of program analysis frameworks
Cousot, P., & Cousot, R. (1979) · Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79 · doi:10.1145/567752.567778 · Cited by 1,621
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Construction of abstract state graphs with PVS
Graf, S., & Saidi, H. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63166-6_10 · Cited by 1,454
A Tool for Checking ANSI-C Programs
Clarke, E., Kroening, D., & Lerda, F. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24730-2_15 · Cited by 1,408
Self-citationVisser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
Extended static checking for Java
Flanagan, C., Leino, K. R. M., Lillibridge, M., Nelson, G., Saxe, J. B., & Stata, R. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512558 · Cited by 1,340
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
Model checking and abstraction
Clarke, E. M., Grumberg, O., & Long, D. E. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/186025.186051 · Cited by 1,211
Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503279 · Cited by 1,155
Points-to analysis in almost linear time
Steensgaard, B. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237727 · Cited by 1,088
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
The Spec# Programming System: An Overview
Barnett, M., Leino, K. R. M., & Schulte, W. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30569-9_3 · Cited by 986
Program Analysis and Specialization for the C Programming Language
Andersen, L. O., & Lee, P. (2005) · Cited by 909
Model checking for programming languages using VeriSoft
Godefroid, P. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263717 · Cited by 825
EXE: automatically generating inputs of death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180445 · Cited by 788
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
Simplify: a theorem prover for program checking
Detlefs, D., Nelson, G., & Saxe, J. B. (2005) · Journal of the ACM · doi:10.1145/1066100.1066102 · Cited by 786
Parametric shape analysis via 3-valued logic
Sagiv, M., Reps, T., & Wilhelm, R. (2002) · ACM Transactions on Programming Languages and Systems · doi:10.1145/514188.514190 · Cited by 785
Miné, A. (2006) · Higher-Order and Symbolic Computation · doi:10.1007/s10990-006-8609-1 · Cited by 720
Automatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442783 · Cited by 694
Henzinger, T. A., Jhala, R., Majumdar, R., & McMillan, K. L. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641655 · Cited by 475
Automatic predicate abstraction of C programs
Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K. (2001) · Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation · doi:10.1145/378795.378846 · Cited by 442
Analysis of pointers and structures
Chase, D., Wegman, M., & Zadeck, F. K. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989429 · Cited by 433
Context-Bounded Model Checking of Concurrent Software
Qadeer, S., & Rehof, J. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31980-1_7 · Cited by 405
Bebop: A Symbolic Model Checker for Boolean Programs
Ball, T., & Rajamani, S. K. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722468_7 · Cited by 372
CMC: a pragmatic approach to model checking real code
Musuvathi, M., Park, D. Y. W., Chou, A., Engler, D. R., & Dill, D. L. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844136 · Cited by 361
Interprocedural may-alias analysis for pointers: beyond k -limiting
Deutsch, A. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178263 · Cited by 328
Boolean and Cartesian Abstraction for Model Checking C Programs
Ball, T., Podelski, A., & Rajamani, S. K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45319-9_19 · Cited by 321
Modular verification of software components in C
Chaki, S., Clarke, E. M., Groce, A., Jha, S., & Veith, H. (2004) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2004.22 · Cited by 319
Henzinger, T. A., Jhala, R., Majumdar, R., & McMillan, K. L. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964021 · Cited by 307
Analysis of pointers and structures
Chase, D. R., Wegman, M., & Zadeck, F. K. (1990) · Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90 · doi:10.1145/93542.93585 · Cited by 303
SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft
Ball, T., Cook, B., Levin, V., & Rajamani, S. K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24756-2_1 · Cited by 294
Behavioral consistency of C and verilog programs using bounded model checking
Clarke, E., Kroening, D., & Yorav, K. (2003) · Proceedings of the 40th annual Design Automation Conference · doi:10.1145/775832.775928 · Cited by 281
Self-citationContext-sensitive synchronization-sensitive analysis is undecidable
Ramalingam, G. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/349214.349241 · Cited by 275
Verification of Real-Time Systems using Linear Relation Analysis
Halbwachs, N., Proy, Y. E., & Roumanoff, P. (1997) · Formal Methods in System Design · doi:10.1023/a:1008678014487 · Cited by 262
Synthesis of Linear Ranking Functions
Colón, M. A., & Sipma, H. B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45319-9_6 · Cited by 215
Scalable error detection using boolean satisfiability
Xie, Y., & Aiken, A. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040334 · Cited by 213
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36377-7_5 · Cited by 202 · cited 2×
“Abstract domains for finding buffer overflows and undefined results in numerical operations are implemented in the Astr´ ee static analyzer [ 25 ], used to verify Airbus flight control software.”
MethodPredicate Abstraction of ANSI-C Programs Using SAT
Clarke, E. M., Kroening, D., Sharygina, N., & Yorav, K. (2004) · Formal Methods in System Design · doi:10.1023/b:form.0000040025.89719.f3 · Cited by 188
Self-citationData flow analysis is model checking of abstract interpretations
Schmidt, D. A. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268950 · Cited by 186
A Practical and Complete Approach to Predicate Refinement
Jhala, R., & McMillan, K. L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11691372_33 · Cited by 185
Beyer, D., Henzinger, T. A., & Théoduloz, G. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_51 · Cited by 182
A direct symbolic approach to model checking pushdown systems
Finkel, A., Willems, B., Wolper, P., & Moller, F. (1997) · ORBi (University of Liège) · Cited by 178
Yovine, S. (1998) · Lecture notes in computer science · doi:10.1007/3-540-65193-4_20 · Cited by 159
Deciding Bit-Vector Arithmetic with Abstraction
Bryant, R. E., Kroening, D., Ouaknine, J., Seshia, S. A., Strichman, O., & Brady, B. A. (2007) · Springer eBooks · doi:10.1007/978-3-540-71209-1_28 · Cited by 152
Self-citationStatic Analysis of Digital Filters
Feret, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24725-8_4 · Cited by 150
Beyer, D., Henzinger, T. A., Majumdar, R., & Rybalchenko, A. (2007) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1250734.1250769 · Cited by 144
Data flow analysis as model checking
Steffen, B. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54415-1_54 · Cited by 137
Extended static checking for Java
Cormac Flanagan, A., Leino, K. R. M., Lillibridge, M., Nelson, G., Saxe, J. B., & Stata, R. (2002) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/512557.512558 · Cited by 132
Tool-supported program abstraction for finite-state verification
Dwyer, M. B., Hatcliff, J., Joehanes, R., Laubach, S., Păsăreanu, C. S., Zheng, H., & Visser, W. (2001) · doi:10.5555/381473.381493 · Cited by 126
Thread-Modular Abstraction Refinement
Henzinger, T. A., Jhala, R., Majumdar, R., & Qadeer, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45069-6_27 · Cited by 119
Abstraction Refinement for Termination
Cook, B., Podelski, A., & Rybalchenko, A. (2005) · Lecture notes in computer science · doi:10.1007/11547662_8 · Cited by 113
Automatic computation of data set definitions
Reynolds, J. C. (2018) · NASA STI Repository (National Aeronautics and Space Administration) · doi:10.1184/r1/6603737 · Cited by 110
Jhala, R., & Majumdar, R. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065016 · Cited by 107
Automatically generating malicious disks using symbolic execution
Yang, J., Sar, C., Twohey, P., et al. (2006) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/sp.2006.7 · Cited by 106
Model checking C programs using F-Soft
Ivančić, F., Shlyakhter, I. A., Gupta, A., Ganai, M., Kahlon, V., Wang, C., & Yang, Z. (2006) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd.2005.77 · Cited by 104
Larus, J. R., Ball, T., Das, M., DeLine, R., Fahndrich, M., Pincus, J., Rajamani, S. K., & Venkatapathy, R. (2004) · IEEE Software · doi:10.1109/ms.2004.1293079 · Cited by 96
The Octahedron Abstract Domain
Clarisó, R., & Cortadella, J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27864-1_23 · Cited by 81
Cleanness Checking of String Manipulations in C Programs via Integer Analysis
Dor, N., Rodeh, M., & Sagiv, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-47764-0_12 · Cited by 79
Jhala, R., & Majumdar, R. (2005) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1065010.1065016 · Cited by 77
Counterexample Driven Refinement for Abstract Interpretation
Gulavani, B. S., & Rajamani, S. K. (2006) · Lecture notes in computer science · doi:10.1007/11691372_34 · Cited by 65
Counterexamples Revisited: Principles, Algorithms, Applications
Clarke, E. M., & Veith, H. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39910-0_9 · Cited by 64
Software Model Checking with Spin
Holzmann, G. J. (2005) · Advances in computers · doi:10.1016/s0065-2458(05)65002-4 · Cited by 46
Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop
Jain, H., Ivančić, F., Gupta, A., et al. (2006) · Lecture notes in computer science · doi:10.1007/11817963_15 · Cited by 39
Checking of operand types in algol compilers
Naur, P. (1965) · BIT Numerical Mathematics · doi:10.1007/bf01940219 · Cited by 30
Metadata
- Authors
- D'Silva, V., Kroening, D., & Weissenbacher, G.
- Venue
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2008-07
- Volume
- 27
- Issue
- 7
- Pages
- 1165-1178
- ISSN
- 0278-0070 (ISSN-L)
- OpenAlex
- W2031525781
- Cited by
- 378
- References
- 77
- FWCI
- 21.77
- 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.