The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Automatic predicate abstraction of C programs
Abstract
Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, state-space explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems.
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
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
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
Proving the Correctness of Multiprocess Programs
Lamport, L. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229904 · Cited by 1,138
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
Automatically Validating Temporal Safety Properties of Interfaces
Ball, T., & Rajamani, S. K. (2001) · Cited by 599
Self-citationParametric shape analysis via 3-valued logic
Sagiv, M., Reps, T., & Wilhelm, R. (1999) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/292540.292552 · Cited by 343
BI as an assertion language for mutable data structures
Ishtiaq, S. S., & O'Hearn, P. W. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.375719 · Cited by 287
Set-based analysis of ML programs
Heintze, N. (1994) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/182409.182495 · Cited by 208
Improving data-flow analysis with path profiles
Ammons, G., & Larus, J. R. (1998) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/277650.277665 · Cited by 130
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
Path-sensitive value-flow analysis
Bodík, R., & Anik, S. (1998) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/268946.268966 · Cited by 78
Safety checking of machine code
Xu, Z., Miller, B. P., & Reps, T. (2000) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/349299.349313 · Cited by 73
Annotation 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
Cited by
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-citationThe 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-citationEXE: 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
Ammons, 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
PScout: analyzing the Android permission specification
Au, K. W. Y., Zhou, Y. F., Huang, Z., & Lie, D. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382222 · Cited by 644
Metadata
- Authors
- Ball, T., Majumdar, R., Millstein, T., & Rajamani, S. K.
- Venue
- Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 2001-05
- Pages
- 203-213
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W4242057943
- Cited by
- 442
- References
- 16
- FWCI
- 16.08
- 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.