The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
The S LAM project: debugging system software via static analysis
Abstract
The goal of the SLAM project is to check whether or not a program obeys "API usage rules" that specify what it means to be a good client of an API. The SLAM toolkit statically analyzes a C program to determine whether or not it violates given usage rules. The toolkit has two unique aspects: it does not require the programmer to annotate the source program (invariants are inferred); it minimizes noise (false error messages) through a process known as "counterexample-driven refinement". SLAM exploits and extends results from program analysis, model checking and automated deduction. We have successfully applied the SLAM toolkit to Windows XP device drivers, to both validate behavior and find defects in their usage of kernel APIs.
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
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
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
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
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
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
Proving the Correctness of Multiprocess Programs
Lamport, L. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229904 · Cited by 1,138
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-citationAmmons, G., Bodík, R., & Larus, J. R. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503275 · Cited by 665
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
A 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 512
Necula, G. C., McPeak, S., & Weimer, W. R. (2012) · ACM SIGPLAN Notices · doi:10.1145/2442776.2442786 · Cited by 502
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-citationAn Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)
Vardi, M. Y., & Wolper, P. (1986) · Logic in Computer Science · Cited by 420
Leino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
Necula, G. C., McPeak, S., & Weimer, W. R. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503286 · Cited by 375
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
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-citationAbstract 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
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
Logic 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 by
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
“It is being integrated with other projects, including SLAM/SDV [1].”
MethodHovemeyer, D., & Pugh, W. (2004) · Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications · doi:10.1145/1028664.1028717 · Cited by 760
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
Satisfiability modulo theories: introduction and applications
De Moura, L., & Bjørner, N. (2011) · Communications of the ACM · doi:10.1145/1995376.1995394 · Cited by 645
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
Metadata
- Authors
- Ball, T., & Rajamani, S. K.
- Venue
- Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2002-01
- Pages
- 1-3
- OpenAlex
- W2082000355
- Cited by
- 923
- References
- 24
- FWCI
- 42.95
- Type
- conference paper
- 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.