Compositional Shape Analysis by Means of Bi-Abduction

@article{Calcagno2011CompositionalSA,
  title={Compositional Shape Analysis by Means of Bi-Abduction},
  author={C. Calcagno and Dino Distefano and P. O'Hearn and H. Yang},
  journal={J. ACM},
  year={2011},
  volume={58},
  pages={26:1-26:66}
}
  • C. Calcagno, Dino Distefano, +1 author H. Yang
  • Published 2011
  • Computer Science
  • J. ACM
  • The accurate and efficient treatment of mutable data structures is one of the outstanding problem areas in automatic program verification and analysis. Shape analysis is a form of program analysis that attempts to infer descriptions of the data structures in a program, and to prove that these structures are not misused or corrupted. It is one of the more challenging and expensive forms of program analysis, due to the complexity of aliasing and the need to look arbitrarily deeply into the… CONTINUE READING
    186 Citations
    Bi-Abductive Inference for Shape and Ordering Properties
    • Chris Curry, Q. Le, S. Qin
    • Computer Science
    • 2019 24th International Conference on Engineering of Complex Computer Systems (ICECCS)
    • 2019
    • 1
    • Highly Influenced
    • PDF
    Learning Shape Analysis
    • 7
    • PDF
    FESA: Fold- and Expand-Based Shape Analysis
    • 7
    • PDF
    A Relational Shape Abstract Domain
    • 6
    • PDF
    Bottom-Up Shape Analysis
    • 31
    • Highly Influenced
    • PDF
    Compositional Verification of Heap-Manipulating Programs through Property-Guided Learning
    • PDF
    A Shape System and Loop Invariant Inference
    • PDF
    Shape Analysis via Second-Order Bi-Abduction
    • 32
    • PDF

    References

    SHOWING 1-3 OF 3 REFERENCES
    Lazy abstraction
    • 1,208
    • Highly Influential
    • PDF
    Thorough static analysis of device drivers
    • 409
    • Highly Influential
    • PDF
    Software model checking
    • 85
    • Highly Influential
    • PDF