The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
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
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
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
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
Local Reasoning about Programs that Alter Data Structures
O’Hearn, P., Reynolds, J., & Yang, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44802-0_1 · Cited by 705
Self-citationResources, concurrency, and local reasoning
O’Hearn, P. W. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.035 · Cited by 552
Self-citationHazard pointers: safe memory reclamation for lock-free objects
Michael, M. M. (2004) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2004.8 · Cited by 508
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
Checking interference with fractional permissions
Boyland, J. (2003) · Cited by 382
Symbolic Execution with Separation Logic
Berdine, J., Calcagno, C., & O’Hearn, P. W. (2005) · Lecture notes in computer science · doi:10.1007/11575467_5 · Cited by 339
Self-citationVerification of Object-Oriented Programs with Invariants.
Barnett, M., DeLine, R. A., Fähndrich, M. A., et al. (2004) · The Journal of Object Technology · doi:10.5381/jot.2004.3.6.a2 · Cited by 325
Checking Interference with Fractional Permissions
Boyland, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44898-5_4 · Cited by 262
A semantics for concurrent separation logic
Brookes, S. D. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.034 · Cited by 245
Alias Types for Recursive Data Structures
Walker, D., & Morrisett, G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45332-6_7 · Cited by 191
Universes: Lightweight Ownership for JML.
Dietl, W., & Müller, P. (2005) · The Journal of Object Technology · doi:10.5381/jot.2005.4.8.a1 · Cited by 176
Resources, Concurrency and Local Reasoning
O’Hearn, P. W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28644-8_4 · Cited by 163
Self-citationSimple Ownership Types for Object Containment
Clarke, D. G., Noble, J., & Potter, J. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45337-7_4 · Cited by 121
A Semantics for Concurrent Separation Logic
Brookes, S. D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28644-8_2 · Cited by 115
Using data groups to specify and check side effects
Leino, K. R. M., Poetzsch‐Heffter, A., & Zhou, Y. (2002) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/512529.512559 · Cited by 114
A semantics for procedure local heaps and its abstractions
Rinetzky, N., Bauer, J., Reps, T., Sagiv, M., & Wilhelm, R. (2005) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1040305.1040330 · Cited by 107
Local reasoning about a copying garbage collector
Birkedal, L., Torp-Smith, N., & Reynolds, J. C. (2004) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/964001.964020 · Cited by 78
Cited by
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
Self-citationViper: A Verification Infrastructure for Permission-Based Reasoning
Müller, P., Schwerhoff, M., & Summers, A. J. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49122-5_2 · Cited by 265
Nagini: A Static Verifier for Python
Eilers, M., & Müller, P. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96145-3_33 · Cited by 51
Eilers, M., Schwerhoff, M., Summers, A. J., & Müller, P. (2025) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-98668-0_5 · Cited by 2
Metadata
- Authors
- Berdine, J., Calcagno, C., & O’Hearn, P. W.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 115-137
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1562865234
- Cited by
- 316
- References
- 22
- FWCI
- 15.85
- 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.