A decade of software model checking with SLAM
The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Abstract
SLAM is a program-analysis engine used to check if clients of an API follow the API's stateful usage rules.
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
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891 · cited 2×
“Bebop uses the Context Free Language Reachability algorithm [38], and implements it symbolically using Binary Decision Diagrams [8].”
MethodClarke, E. M., Grümberg, O., & Long, D. (1996) · Cited by 6,813
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
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
Clarke, E. M., & Schlingloff, B. (1999) · Cited by 5,570
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
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
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
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
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 · cited 1×
“Model checking [13, 12, 37] has been used extensively to algorithmically check temporal logic properties of models.”
MethodAn Automata-Theoretic Approach to Automatic Program Verification
Vardi, M. Y., & Wolper, P. (1986) · ORBi (University of Liège) · Cited by 1,261
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 · cited 2×
“Bebop uses the Context Free Language Reachability algorithm [38], and implements it symbolically using Binary Decision Diagrams [8].”
MethodHenzinger, 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 · cited 1×
“The Blast project [27] at Berkeley proposed a technique called “lazy abstraction” to optimize the work in constructing and maintaining the abstractions across the iterations in the CEGAR loop.”
MethodAutomated Whitebox Fuzz Testing.
Godefroid, P., Levin, M. Y., & Molnar, D. A. (2008) · Cited by 1,095
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 · cited 1×
“The Bandera project explored the idea of user-guided finite-state abstractions for Java programs [17], based on predicate abstraction and manual abstraction, but without automatic refinement of abstractions.”
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
Self-citationInterpolation and SAT-Based Model Checking
McMillan, K. L. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45069-6_1 · Cited by 908 · cited 1×
“McMillan proposed interpolants as a more systematic and general way to perform refinement [35].”
MethodSimplify: 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
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
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 static analyzer for finding dynamic programming errors
Bush, W. R., Pincus, J. D., & Sielaff, D. (2000) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(200006)30:7<775::aid-spe309>3.0.co;2-h · Cited by 600
Automatically Validating Temporal Safety Properties of Interfaces
Ball, T., & Rajamani, S. K. (2001) · Cited by 599
Self-citationChecking system rules using system-specific, programmer-written compiler extensions
Engler, D., Chelf, B., Chou, A., & Hallem, S. (2000) · doi:10.5555/1251229.1251230 · Cited by 535
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
Self-citationFlow-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 · cited 1×
“The Cqual project uses “type qualifiers” to specify API usage rules and uses type inference to check C code against the type qualifer annotations [22].”
MethodBebop: 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
Self-citationBoolean 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
Self-citationHenzinger, 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 · cited 1×
“Predicates generated from interpolants were found to have nice local properties and were used to implement local abstractions in Blast [26].”
MethodKISS: 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 · cited 1×
“Qadeer and Wu used SLAM to encode all interleavings with two context switches in a concurrent program [36].”
MethodModel checking: algorithmic verification and debugging
Clarke, E. M., Emerson, E. A., & Sifakis, J. (2009) · Communications of the ACM · doi:10.1145/1592761.1592781 · Cited by 287 · cited 3×
“We often see model checking referred to as a“push button” technology [13], giving the impression that the user simply”
BackgroundMethodCompositional may-must program analysis: unleashing the power of alternation
Godefroid, P., Nori, A. V., Rajamani, S. K., & Tetali, S. D. (2010) · Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1706299.1706307 · Cited by 214
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 125 · cited 1×
“This idea has been pursued by several projects, including CBMC [15], F-Soft [30] and saturn [1].”
MethodProceedings 2015 Network and Distributed System Security Symposium
(2015) · doi:10.14722/ndss.2015 · Cited by 124
An overview of the saturn project
Aiken, A., Bugrara, S., Dillig, I., Dillig, T., Hackett, B., & Hawkins, P. (2007) · ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) · doi:10.1145/1251535.1251543 · Cited by 123 · cited 1×
“This idea has been pursued by several projects, including CBMC [15], F-Soft [30] and saturn [1].”
MethodAbstraction Refinement for Termination
Cook, B., Podelski, A., & Rybalchenko, A. (2005) · Lecture notes in computer science · doi:10.1007/11547662_8 · Cited by 113 · cited 1×
“CEGAR has been generalized to concurrent programs, properties of heap manipulating programs [7], and the problem of program termination [16].”
BackgroundLogic Verification of ANSI-C Code with SPIN
Holzmann, G. J. (2000) · Lecture notes in computer science · doi:10.1007/10722468_8 · Cited by 112 · cited 1×
“Other contemporary techniques for analyzing C code against temporal rules in the early 2000s included the meta-level compilation approach of Engler and colleagues [20], and an extension of SPIN to handle ANSI C [29].”
MethodSLIC: A Specification Language for Interface Checking (of C)
Ball, T., & Rajamani, S. K. (2002) · Cited by 110
Self-citationLarus, 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 · cited 1×
“At Microsoft, the ESP and Vault projects started in the same group as SLAM and explored different ways of checking API usage rules [33].”
MethodSelf-citation
Metadata
- Authors
- Ball, T., Levin, V., & Rajamani, S. K.
- Venue
- Communications of the ACM
- Published
- 2011-07
- Volume
- 54
- Issue
- 7
- Pages
- 68-76
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2105614525
- Cited by
- 217
- References
- 42
- FWCI
- 86.51
- 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.