Compositional shape analysis by means of bi-abduction
The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
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.
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
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 · cited 1×
“We emphasize that Abductor computes a genuine over-approximation (with respect to an idealized model) in the sense of abstract interpretation [Cousot and Cousot 1977].”
MethodCollected 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-citationSoundness and Completeness of an Axiom System for Program Verification
Cook, S. A. (1978) · SIAM Journal on Computing · doi:10.1137/0207005 · Cited by 461
Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31987-0_3 · Cited by 426
The complexity of logic-based abduction
Eiter, T., & Gottlob, G. (1995) · Journal of the ACM · doi:10.1145/200836.200838 · Cited by 422
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Thorough static analysis of device drivers
Ball, T., Bounimova, E., Cook, B., Levin, V., Lichtenberg, J., McGarvey, C., Ondrusek, B., Rajamani, S. K., & Ustuner, A. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217943 · Cited by 371
Program Flow Analysis: Theory and Application
Muchnick, S. S., & Jones, N. D. (1981) · Medical Entomology and Zoology · Cited by 361
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-citationA Local Shape Analysis Based on Separation Logic
Distefano, D., O’Hearn, P. W., & Yang, H. (2006) · Lecture notes in computer science · doi:10.1007/11691372_19 · Cited by 328
Self-citationSolving shape-analysis problems in languages with destructive updating
Sagiv, M., Reps, T., & Wilhelm, R. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271517 · Cited by 322
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Berdine, J., Calcagno, C., & O’Hearn, P. W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11804192_6 · Cited by 316
Self-citationIs it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C
Ghiya, R., & Hendren, L. J. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237724 · Cited by 287
DeLine, R., & Fähndrich, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24851-4_21 · Cited by 253
jStar: towards practical verification for java
Distefano, D., & J, M. J. P. (2008) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1449764.1449782 · Cited by 232
Self-citationScalable Shape Analysis for Systems Code
Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., & O’Hearn, P. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70545-1_36 · Cited by 231
Self-citationApproaches to abductive reasoning: an overview
Paul, G. (1993) · Artificial Intelligence Review · doi:10.1007/bf00849080 · Cited by 190
Relational inductive shape analysis
Chang, B.-Y. E., & Rival, X. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328469 · Cited by 166
Modular Static Program Analysis
Cousot, P., & Cousot, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_13 · Cited by 163
Possible worlds and resources: the semantics of BI
Pym, D. J., O’Hearn, P. W., & Yang, H. (2003) · Theoretical Computer Science · doi:10.1016/j.tcs.2003.11.020 · Cited by 159
Self-citationLifting abstract interpreters to quantified logical domains
Gulwani, S., McCloskey, B., & Tiwari, A. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328468 · Cited by 149
Kunčak, V., Lam, P., & Rinard, M. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503276 · Cited by 124
Gotsman, A., Berdine, J., Cook, B., & Sagiv, M. (2007) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1250734.1250765 · Cited by 109
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
Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
Manevich, R., Yahav, E., Ramalingam, G., & Sagiv, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30579-8_13 · Cited by 101
Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
Calcagno, C., Distefano, D., O’Hearn, P. W., & Yang, H. (2006) · Lecture notes in computer science · doi:10.1007/11823230_13 · Cited by 79
Self-citationArithmetic Strengthening for Shape Analysis
Magill, S., Berdine, J., Clarke, E. M., & Cook, B. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74061-2_26 · Cited by 68
Shape Analysis with Structural Invariant Checkers
Chang, B.-Y. E., Rival, X., & Necula, G. C. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74061-2_24 · Cited by 64
Practical memory leak detector based on parameterized procedural summaries
Jung, Y., & Yi, K. (2008) · International Symposium on Memory Management · doi:10.1145/1375634.1375653 · Cited by 56
Computing Procedure Summaries for Interprocedural Analysis
Gulwani, S., & Tiwari, A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-71316-6_18 · Cited by 53
Low-Level Library Analysis and Summarization
Gopan, D., & Reps, T. (2007) · Springer eBooks · doi:10.1007/978-3-540-73368-3_10 · Cited by 43
Bi-abductive Resource Invariant Synthesis
Calcagno, C., Distefano, D., & Vafeiadis, V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10672-9_19 · Cited by 37
Self-citationEfficient Context-Sensitive Shape Analysis with Graph Based Heap Models
Marron, M., Hermenegildo, M. V., Kapur, D., & Stefanović, D. (2008) · Springer eBooks · doi:10.1007/978-3-540-78791-4_17 · Cited by 25
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
DeepWukong: Statically Detecting Software Vulnerabilities Using Deep Graph Neural Network
Cheng, X., Wang, H., Hua, J., Xu, G., & Sui, Y. (2021) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3436877 · Cited by 335
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
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.