Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 309

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

Parkinson, Matthew, Bierman, Gavin·2005·Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1040305.1040326

Cites

14 of 14 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 14 references

Cited by

See all 309

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Separation logic and abstraction. https://app.cochat.ai/papers/10.1145/1040305.1040326
The paper
Parkinson, M., & Bierman, G. (2005). Separation logic and abstraction. Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/1040305.1040326

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.