Relational inductive shape analysis

ACM SIGPLAN Notices

Volumn 43, Issue 1, 2008, Pages 247-260

  Chang, Bor Yuh Evan ^a   Rival, Xavier ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Heap analysis; Inductive definitions; Materialization; Separation logic; Shape analysis; Symbolic abstract domain

Indexed keywords

ABSTRACTING; SPECIFICATIONS;

ABSTRACT DOMAINS; HEAP ANALYSIS; INDUCTIVE DEFINITIONS; MATERIALIZATION; SEPARATION LOGIC; SHAPE ANALYSIS;

DATA STRUCTURES;

EID: 67650136341     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1328897.1328469     Document Type: Article

References (23)

1. Gilad Arnold. Specialized 3-valued logic shape analysis using structure-based refinement and loose embedding. In Static Analysis (SAS), 2006.
2. Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn, Thomas Wies, and Hongseok Yang. Shape analysis for composite data structures. In Computer-Aided Verification (CAV), 2007.
3. Bor-Yuh Evan Chang, Xavier Rival, and George C. Necula. Shape analysis with structural invariant checkers. In Static Analysis (SAS), 2007.
4. Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, and Zvonimir Raka-maric. A reachability predicate for analyzing low-level software. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2007.
5. Sigmund Cherem and Radu Rugina. Maintaining doubly-linked list invariants in shape analysis with local reasoning. In Verification, Model Checking, and Abstract Interpretation (VMCAI), 2007.
6. Patrick Cousot. Verification by abstract interpretation. In Verification: Theory and Practice, 2003.
7. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Principles of Programming Languages (POPL), 1977.
8. Dino Distefano, Peter W. O'Hearn, and Hongseok Yang. A local shape analysis based on separation logic. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2006.
9. Denis Gopan, Thomas W. Reps, and Shmuel Sagiv. A framework for numeric analysis of array operations. In Principles of Programming Languages (POPL), 2005.
10. Sumit Gulwani and Ashish Tiwari. An abstract domain for analyzing heap-manipulating low-level software. In Computer-Aided Verification (CAV), 2007.
11. Bolei Guo, Neil Vachharajani, and David I. August. Shape analysis with inductive recursion synthesis. In Programming Language Design and Implementation (PLDI), 2007.
12. Michael Karr. Affine relationships among variables of a program. Acta Inf., 6, 1976.
13. Oukseh Lee, Hongseok Yang, and Kwangkeun Yi. Automatic verification of pointer programs using grammar-based shape analysis. In European Symposium on Programming (ESOP), 2005.
14. Tal Lev-Ami, Thomas W. Reps, Shmuel Sagiv, and Reinhard Wilhelm. Putting static analysis to work for verification: A case study. In Software Testing and Analysis (ISSTA), 2000.
15. Stephen Magill, Josh Berdine, Edmund Clarke, and Byron Cook. Arithmetic strengthening for separation logic based shape analyses. In Static Analysis (SAS), 2007.
16. Scott McPeak and George C. Necula. Data structure specifications via local equality axioms. In Computer-Aided Verification (CAV), 2005.
17. Antoine Miné. The octagon abstract domain. Higher-Order and Symbolic Computation, 19(1), 2006.
18. Anders Møller and Michael I. Schwartzbach. The pointer assertion logic engine. In Programming Language Design and Implementation (PLDI), 2001.
19. Huu Hai Nguyen, Cristina David, Shengchao Qin, and Wei-Ngan Chin. Automated verification of shape and size properties via separation logic. In Verification, Model Checking, and Abstract Interpretation (VMCAI), 2007.
20. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science (LICS), 2002.
21. Radu Rugina. Quantitative shape analysis. In Static Analysis (SAS), 2004.
22. Shmuel Sagiv, Thomas W. Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst., 24(3), 2002.
23. Arnaud Venet. Abstract cofibered domains: Application to the alias analysis of untyped programs. In Static Analysis (SAS), 1996.