The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Separation logic and abstraction
Abstract
In this paper we address the problem of writing specifications for programs that use various forms of modularity, including procedures and Java-like classes. We build on the formalism of separation logic and introduce the new notion of an abstract predicate and, more generally, abstract predicate families. This provides a flexible mechanism for reasoning about the different forms of abstraction found in modern programming languages, such as abstract datatypes and objects. As well as demonstrating the soundness of our proof system, we illustrate its utility with a series of examples.
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
Stroustrup, B. (1985) · Cited by 4,409
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
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
Abadi, M., & Cardelli, L. (1996) · Monographs in Computer Science · doi:10.1007/978-1-4419-8598-9 · Cited by 1,001
Proof of correctness of data representations
Hoare, C. A. R. (1972) · Acta Informatica · doi:10.1007/bf00289507 · Cited by 966
Programming with abstract data types
Liskov, B., & Zilles, S. (1974) · Proceedings of the ACM SIGPLAN symposium on Very high level languages - · doi:10.1145/800233.807045 · Cited by 734
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
Abstract types have existential type
Mitchell, J. C., & Plotkin, G. D. (1988) · ACM Transactions on Programming Languages and Systems · doi:10.1145/44501.45065 · Cited by 429
Verification 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
Ownership, encapsulation and the disjointness of type and effect
Clarke, D., & Drossopoulou, S. (2002) · Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '02 · doi:10.1145/582419.582447 · Cited by 257
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
Leino, K. R. M. (1998) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/286936.286953 · Cited by 157
Data abstraction and information hiding
Leino, K. R. M., & Nelson, G. (2002) · ACM Transactions on Programming Languages and Systems · doi:10.1145/570886.570888 · Cited by 134
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
Dafny: An Automatic Program Verifier for Functional Correctness
Leino, K. R. M. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17511-4_20 · Cited by 940
Viper: 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
“Assertions can be abstracted over using predicates [17], declared in Nagini by using annotated functions (line 12).”
BackgroundEilers, 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
- Parkinson, M., & Bierman, G.
- Venue
- Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2005-01-12
- Pages
- 247-258
- OpenAlex
- W2171685273
- Cited by
- 309
- References
- 14
- FWCI
- 17.17
- 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.