The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Compositional shape analysis by means of bi-abduction
Abstract
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted fragment of separation logic, and assigns a collection of Hoare triples to each procedure; the triples provide an over-approximation of data structure usage. Compositionality brings its usual benefits -- increased potential to scale, ability to deal with unknown calling contexts, graceful way to deal with imprecision -- to shape analysis, for the first time.
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
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
Collected Papers of Charles Sanders Peirce
(1935) · Nature · doi:10.1038/135131a0 · Cited by 4,604
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
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
KAKAS, A. C., KOWALSKI, R. A., & TONI, F. (1992) · Journal of Logic and Computation · doi:10.1093/logcom/2.6.719 · Cited by 827
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-citationBI as an assertion language for mutable data structures
Ishtiaq, S., & O'Hearn, P. W. (2011) · ACM SIGPLAN Notices · doi:10.1145/1988042.1988050 · Cited by 489
Self-citation
Cited by
VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., & Piessens, F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20398-5_4 · Cited by 362
Metadata
- Authors
- Calcagno, C., Distefano, D., O'Hearn, P., & Yang, H.
- Venue
- Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2009-01-21
- Pages
- 289-300
- OpenAlex
- W2154985136
- Cited by
- 279
- References
- 41
- FWCI
- 26.09
- 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: Compositional shape analysis by means of bi-abduction. https://app.cochat.ai/papers/10.1145/1480881.1480917
- The paper
- Calcagno, C., Distefano, D., O'Hearn, P., & Yang, H. (2009). Compositional shape analysis by means of bi-abduction. Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/1480881.1480917
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.