The DOI matches its Crossref record; 158 of the 158 references it cites were found in a registry or an index.
Software model checking
Abstract
We survey recent progress in software model checking.
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
Artificial intelligence: a modern approach
(1995) · Choice Reviews Online · doi:10.5860/choice.33-1577 · Cited by 21,974
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Artificial intelligence: A modern approach
Nilsson, N. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(96)00007-0 · Cited by 10,583
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595 · cited 2×
“I1 The satis.ability checks can be discharged by a decision procedure [Nelson 1981; Dutertre and de Moura 2006; de Moura and BjØrner 2008].”
MethodCousot, 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
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
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
Symbolic execution and program testing
King, J. C. (1976) · Communications of the ACM · doi:10.1145/360248.360252 · Cited by 3,031
The 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
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
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
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
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
Separation logic: a logic for shared mutable data structures
Reynolds, J. C. (2003) · Proceedings 17th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029817 · Cited by 2,156
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
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
CUTE: a concolic unit testing engine for C
Sen, K., Marinov, D., & Agha, G. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081750 · Cited by 1,651
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
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065036 · Cited by 1,570
Depth-first iterative-deepening
Korf, R. E. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90084-0 · Cited by 1,562
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
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Visser, 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
Implementing Mathematics with The Nuprl Proof Development System
Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., et al. (1986) · Cited by 1,279
Precise interprocedural dataflow analysis via graph reachability
Reps, T., Horwitz, S., & Sagiv, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199462 · Cited by 1,170
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
Self-citationPoints-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
Assigning Meanings to Programs
Floyd, R. W. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_4 · Cited by 1,079
Bandera: extracting finite-state models from Java source code
Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337234 · Cited by 1,059
Symbolic model checking: an approach to the state explosion problem
McMillan, K. L. (1992) · Defense Technical Information Center (DTIC) · Cited by 979
The S LAM project: debugging system software via static analysis
Ball, T., & Rajamani, S. K. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503274 · Cited by 923
Program Analysis and Specialization for the C Programming Language
Andersen, L. O., & Lee, P. (2005) · Cited by 899
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
Model checking JAVA programs using JAVA PathFinder
Havelund, K., & Pressburger, T. (2000) · International Journal on Software Tools for Technology Transfer (STTT) · doi:10.1007/s100090050043 · Cited by 800
Reasoning about Infinite Computations
Vardi, M. Y., & Wolper, P. (1994) · Information and Computation · doi:10.1006/inco.1994.1092 · Cited by 795
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
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
A System to Generate Test Data and Symbolically Execute Programs
Clarke, L. A. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233817 · Cited by 764
Symbolic model checking using SAT procedures instead of BDDs
Biere, A., Cimatti, A., Clarke, E. M., Fujita, M., & Zhu, Y. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.309942 · Cited by 752
Miné, A. (2006) · Higher-Order and Symbolic Computation · doi:10.1007/s10990-006-8609-1 · Cited by 720
Checking Safety Properties Using Induction and a SAT-Solver
Sheeran, M., Singh, S., & Stålmarck, G. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40922-x_8 · Cited by 719
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
Self-citationA Fast Linear-Arithmetic Solver for DPLL(T)
Dutertre, B., & de Moura, L. (2006) · Lecture notes in computer science · doi:10.1007/11817963_11 · Cited by 679
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
Typestate: A programming language concept for enhancing software reliability
Strom, R. E., & Yemini, S. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312929 · Cited by 626
Tentative steps toward a development method for interfering programs
Jones, C. B. (1983) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69575.69577 · Cited by 617
Fast Decision Procedures Based on Congruence Closure
Nelson, G., & Oppen, D. C. (1980) · Journal of the ACM · doi:10.1145/322186.322198 · Cited by 611
The software model checker Blast: Applications to software engineering
Beyer, D., Henzinger, T. A., Jhala, R., & Majumdar, R. (2007) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-007-0044-z · Cited by 585
Self-citationCloning-based context-sensitive pointer alias analysis using binary decision diagrams
Whaley, J., & Lam, M. S. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996859 · Cited by 582
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781153 · Cited by 573
Recognizing safety and liveness
Alpern, B., & Schneider, F. B. (1987) · Distributed Computing · doi:10.1007/bf01782772 · Cited by 557
ESP: path-sensitive program verification in polynomial time
Das, M., Lerner, S., & Seigle, M. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512538 · Cited by 552
Alur, R., & Henzinger, T. A. (1999) · Formal Methods in System Design · doi:10.1023/a:1008739929481 · Cited by 541
Social processes and proofs of theorems and programs
De Millo, R. A., Lipton, R. J., & Perlis, A. J. (1979) · Communications of the ACM · doi:10.1145/359104.359106 · Cited by 537
Specifying Concurrent Program Modules
Lamport, L. (1983) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69624.357207 · Cited by 524
Automata-theoretic techniques for modal logics of programs
Vardi, M. Y., & Wolper, P. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90026-7 · Cited by 522
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
Constructive mathematics and computer programming
Martin-Lof, P. (1984) · Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences · doi:10.1098/rsta.1984.0073 · Cited by 499
Proofs of Networks of Processes
Misra, J., & Chandy, K. M. (1981) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1981.230844 · Cited by 493
Iterative context bounding for systematic testing of multithreaded programs
Musuvathi, M., & Qadeer, S. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250785 · Cited by 483
Bagnara, R., Hill, P. M., & Zaffanella, E. (2008) · Science of Computer Programming · doi:10.1016/j.scico.2007.08.001 · Cited by 477
Henzinger, T. A., Jhala, R., Majumdar, R., & McMillan, K. L. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641655 · Cited by 475
Self-citationStatic determination of dynamic properties of programs
Cousot, P. M., & Cousot, R. (1976) · Cited by 473
Soundness and Completeness of an Axiom System for Program Verification
Cook, S. A. (1978) · SIAM Journal on Computing · doi:10.1137/0207005 · Cited by 461
Abadi, M., & Lamport, L. (1995) · ACM Transactions on Programming Languages and Systems · doi:10.1145/203095.201069 · Cited by 456
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
Self-citationComputer-Aided Verification of Coordinating Processes
Kurshan, R. P. (1995) · Princeton University Press eBooks · doi:10.1515/9781400864041 · Cited by 440
Analysis of pointers and structures
Chase, D., Wegman, M., & Zadeck, F. K. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989429 · Cited by 433
Flow-sensitive type qualifiers
Foster, J. S., Terauchi, T., & Aiken, A. (2002) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/512529.512531 · Cited by 412
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
MOCHA: Modularity in model checking
Alur, R., Henzinger, T. A., Mang, F. Y. C., Qadeer, S., Rajamani, S. K., & Tasiran, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028774 · Cited by 382
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
Thorough static analysis of device drivers
Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S. K., & Ustuner, A. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217943 · Cited by 371
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
Deciding Combinations of Theories
Shostak, R. E. (1984) · Journal of the ACM · doi:10.1145/2422.322411 · Cited by 341
Handbook of theoretical computer science
Czerbo, D. B. (1992) · Artificial Intelligence in Medicine · doi:10.1016/0933-3657(92)90044-p · Cited by 338
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation · doi:10.1145/781131.781153 · Cited by 330 · cited 1×
“The Astree analysis tool [Blanchet et al. 2002; Blanchet et al. 2003] is probably the best example of using combinations of abstract domains to enable precise and scalable verification.”
A Local Shape Analysis Based on Separation Logic
Distefano, D., O’Hearn, P. W., & Yang, H. (2006) · Lecture notes in computer science · doi:10.1007/11691372_19 · 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
Termination proofs for systems code
Cook, B., Podelski, A., & Rybalchenko, A. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134029 · Cited by 317
Using model checking to find serious file system errors
Yang, J., Twohey, P., Engler, D., & Musuvathi, M. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1189256.1189259 · Cited by 310
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
Self-citationAnalysis 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
Francez, N. (1986) · Springer eBooks · doi:10.1007/978-1-4612-4886-6 · Cited by 302
KISS: keep it simple and sequential
Qadeer, S., & Wu, D. (2004) · Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation · doi:10.1145/996841.996845 · Cited by 297
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
Ghiya, R., & Hendren, L. J. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237724 · Cited by 287
Predicate abstraction for software verification
Flanagan, C., & Qadeer, S. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503291 · Cited by 284
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
Context-sensitive synchronization-sensitive analysis is undecidable
Ramalingam, G. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/349214.349241 · Cited by 275
Flanagan, C. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111059 · Cited by 265
DeLine, R., & Fähndrich, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24851-4_21 · Cited by 253
TVLA: A System for Implementing Static Analyses
Lev-Ami, T., & Sagiv, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45099-3_15 · Cited by 250
SYNERGY: a new algorithm for property checking
Gulavani, B. S., Henzinger, T. A., Kannan, Y., Nori, A. V., & Rajamani, S. K. (2006) · Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1181775.1181790 · Cited by 249
Termination proofs for systems code
Cook, B., Podelski, A., & Rybalchenko, A. (2006) · Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1134029 · Cited by 240
Scalable Shape Analysis for Systems Code
Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., & O’Hearn, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70545-1_36 · Cited by 231
Scalable Analysis of Linear Systems Using Mathematical Programming
Sankaranarayanan, S., Sipma, H. B., & Manna, Z. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30579-8_2 · Cited by 222
Avoiding exponential explosion: generating compact verification conditions
Flanagan, C., & Saxe, J. B. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.360220 · Cited by 220
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 1×
“The Astree analysis tool [Blanchet et al. 2002; Blanchet et al. 2003] is probably the best example of using combinations of abstract domains to enable precise and scalable verification.”
Generating Tests from Counterexamples
Beyer, D., Chlipala, A. J., Henzinger, T. A., et al. (2004) · Cited by 198
The Murphi Verification System
Dill, D. L. (1996) · Computer Aided Verification · Cited by 190
Validation with guided search of the state space
Yang, C. H., & Dill, D. L. (1998) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/277044.277201 · Cited by 189
Data 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
Self-citationBeyer, 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
Abstract and Model Check while You Prove
Saïdi, H., & Shankar, N. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48683-6_38 · Cited by 168
Directed explicit-state model checking in the validation of communication protocols
Edelkamp, S., Leue, S., & Lluch-Lafuente, A. (2004) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-002-0104-3 · Cited by 168
Relational inductive shape analysis
Chang, B.-Y. E., & Rival, X. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328469 · Cited by 166
Practical Methods for Proving Program Termination
Colón, M. A., & Sipma, H. B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45657-0_36 · Cited by 164
A framework for numeric analysis of array operations
Gopan, D., Reps, T., & Sagiv, M. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040333 · Cited by 162
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
Podelski, A., & Rybalchenko, A. (2006) · Lecture notes in computer science · doi:10.1007/978-3-540-69611-7_16 · Cited by 155
Counterexample-guided predicate abstraction of hybrid systems
Alur, R., Dang, T., & Ivančić, F. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.11.026 · Cited by 154
Back to the future: revisiting precise program verification using SMT solvers
Lahiri, S. K., & Qadeer, S. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328461 · Cited by 150
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Păsăreanu, C. S., Giannakopoulou, D., Bobaru, M. G., Cobleigh, J. M., & Howard Barringer, B. (2008) · Formal Methods in System Design · doi:10.1007/s10703-008-0049-6 · Cited by 149
Lifting abstract interpreters to quantified logical domains
Gulwani, S., McCloskey, B., & Tiwari, A. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328468 · Cited by 149
A generic approach to the static analysis of concurrent programs with procedures
Bouajjani, A., Esparza, J., & Touili, T. (2003) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/604131.604137 · Cited by 149
Calysto: scalable and precise extended static checking
Babić, D., & Hu, A. J. (2008) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/1368088.1368118 · Cited by 148
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
Self-citationData flow analysis as model checking
Steffen, B. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54415-1_54 · Cited by 137
Verifying safety properties of concurrent Java programs using 3-valued logic
Yahav, E. (2001) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/360204.360206 · Cited by 134
Program Analysis as Model Checking of Abstract Interpretations
Schmidt, D. A., & Steffen, B. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49727-7_22 · Cited by 131
Temporal abstract interpretation
Cousot, P. M., & Cousot, R. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325699 · Cited by 120
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
Self-citationBeckman, N. E., Nori, A. V., Rajamani, S. K., & Simmons, R. J. (2008) · International Symposium on Software Testing and Analysis · doi:10.1145/1390630.1390634 · Cited by 119
Jhala, R., & Majumdar, R. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065016 · Cited by 107
Self-citationEfficient SAT-based bounded model checking for software verification
Ivančić, F., Yang, Z., Ganai, M., Gupta, A., & Ashar, P. N. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.03.013 · Cited by 103
Relative Completeness of Abstraction Refinement for Software Model Checking
Ball, T., Podelski, A., & Rajamani, S. K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46002-0_12 · Cited by 96
Automatically Refining Abstract Interpretations
Gulavani, B. S., Chakraborty, S., Nori, A. V., & Rajamani, S. K. (2008) · Springer eBooks · doi:10.1007/978-3-540-78800-3_33 · Cited by 89
Model Checking Guided Abstraction and Analysis
Saïdi, H. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-45099-3_20 · Cited by 84
Constructing Quantified Invariants via Predicate Abstraction
Lahiri, S. K., & Bryant, R. E. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24622-0_22 · Cited by 81
Verifying Concurrent Message-Passing C Programs with Recursive Calls
Chaki, S., Clarke, E. M., Kidd, N. A., Reps, T., & Touili, T. (2006) · Lecture notes in computer science · doi:10.1007/11691372_22 · Cited by 80
Combining abstract interpreters
Gulwani, S., & Tiwari, A. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134026 · Cited by 78
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
Self-citationArithmetic Strengthening for Shape Analysis
Magill, S., Berdine, J., Clarke, E. M., & Cook, B. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74061-2_26 · Cited by 68
Accelerating high-level bounded model checking
Ganai, M., & Gupta, A. (2006) · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · doi:10.1145/1233501.1233664 · Cited by 65
Efficient Verification of Sequential and Concurrent C Programs
Chaki, S., Clarke, E. M., Groce, A., Ouaknine, J., Strichman, O., & Yorav, K. (2004) · Formal Methods in System Design · doi:10.1023/b:form.0000040026.56959.91 · Cited by 64
Joining dataflow with predicates
Fischer, J. S., Jhala, R., & Majumdar, R. (2005) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/1081706.1081742 · Cited by 63
Self-citationModular verification of multithreaded programs
Cormac Flanagan, A., Freund, S. N., Qadeer, S., & Seshia, S. A. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.006 · Cited by 60
Gupta, A., Majumdar, R., & Rybalchenko, A. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00768-2_24 · Cited by 59
Self-citationAnnotation inference for modular checkers
Cormac Flanagan, A., Joshi, R., & Leino, K. R. M. (2001) · Information Processing Letters · doi:10.1016/s0020-0190(00)00196-4 · Cited by 56
Combining abstract interpreters
Gulwani, S., & Tiwari, A. (2006) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1133981.1134026 · Cited by 56
Symbolic Context-Bounded Analysis of Multithreaded Java Programs
Suwimonteerabuth, D., Esparza, J., & Schwoon, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85114-1_19 · 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
Widening Operators for Weakly-Relational Numeric Abstractions
Roberto Bagnara, A., Hill, P. M., Mazzi, E., & Enea Zaffanella, A. (2005) · Lecture notes in computer science · doi:10.1007/11547662_3 · Cited by 28
Cited by
Zhang, F., Chen, J., Chen, H., & Zang, B. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043576 · Cited by 372
Ghaffarian, S. M., & Shahriari, H. R. (2018) · ACM Computing Surveys · doi:10.1145/3092566 · Cited by 353
Compositional shape analysis by means of bi-abduction
Calcagno, C., Distefano, D., O'Hearn, P., & Yang, H. (2009) · Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1480881.1480917 · Cited by 279
Avgerinos, T., Cha, S. K., Rebert, A., Schwartz, E. J., Woo, M., & Brumley, D. (2014) · Communications of the ACM · doi:10.1145/2560217.2560219 · Cited by 263
BRKAN, M., & BONNET, G. (2020) · European Journal of Risk Regulation · doi:10.1017/err.2020.10 · Cited by 63
Metadata
- Authors
- Jhala, R., & Majumdar, R.
- Venue
- ACM Computing Surveys
- Published
- 2009-10
- Volume
- 41
- Issue
- 4
- Pages
- 1-54
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2081840025
- Cited by
- 418
- References
- 158
- FWCI
- 25.75
- 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.