Shape analysis with structural invariant checkers

Shape analysis with structural invariant checkers (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Bor-yuh Evan Chang , Xavier Rival , George C. Necula

Citations:

15 - 6 self

BibTeX

@TECHREPORT{Chang07shapeanalysis,
    author = {Bor-yuh Evan Chang and Xavier Rival and George C. Necula},
    title = {Shape analysis with structural invariant checkers},
    institution = {},
    year = {2007}
}

Bookmark

OpenURL

Abstract

Abstract. Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the desired shape invariants. We observe that data structure checking code (e.g., used in testing or dynamic analysis) provides shape information that can also be used in static analysis. In this paper, we propose a lightweight, automatic shape analysis based on these developer-supplied structural invariant checkers. In particular, we set up a parametric abstract domain, which is instantiated with such checker specifications to summarize memory regions using both notions of complete and partial checker evaluations. The analysis then automatically derives a strategy for canonicalizing or weakening shape invariants. 1

Citations

1635	Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints - Cousot, Cousot - 1977
583	Separation logic: A logic for shared mutable data structures. Symp. on Logic in - Reynolds - 1994
465	Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, et al. - 1999
330	CIL: Intermediate language and tools for analysis and transformation of C programs - Necula, McPeak, et al. - 2002
315	Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints - Patrick - 1977
279	Skip lists – a probabilistic alternative to balanced trees - Pugh - 1990
128	The pointer assertion logic engine - Møller, Schwartzbach - 2001
108	A local shape analysis based on separation logic - Distefano, O’Hearn, et al. - 2006
71	R.: Region-Based Shape Analysis with Tracked Locations - Hackett
67	Data structure specifications via local equality axioms - McPeak, Necula - 2005
66	Shape analysis for composite data structures - Berdine, Calcagno, et al. - 2007
50	lists: a probabilistic alternative to balanced trees - Skip - 1990
44	Trace partitioning in abstract interpretation based static analyzers - Mauborgne, Rival - 2005
40	Automatic verification of pointer programs using grammar-based shape analysis - Lee, Yang, et al. - 2005
30	Field constraint analysis - Wies, Kuncak, et al. - 2006
27	Partially disjunctive heap abstraction - Manevich, Sagiv, et al. - 2004
18	Inferring invariants in separation logic for imperative list-processing programs - Magill, Nanevski, et al.
6	Specialized 3-valued logic shape analysis using structure-based refinement and loose embedding - Arnold - 2006
5	Maintaining doubly-linked list invariants in shape analysis with local reasoning - Cherem, Rugina - 2007
4	Expressing heap-shape contracts in linear logic - Perry, Jia, et al. - 2006
4	and Radu Rugina. Region–based shape analysis with tracked locations - Hackett - 2005
2	Mooly Sagiv. Automated verification of the DeutschSchorr-Waite tree-traversal algorithm - Loginov, Reps - 2007
1	Shape analysis for composite data structures - O’Hearn, Yang - 2007
1	Cherem and Radu Rugina. Maintaining doubly-linked list invariants in shape analysis with local reasoning - Sigmund - 2007
1	Analysis with Structural Invariant Checkers 401 - Shape - 2005
1	Separation logic: A logic for shared mutable data structures - ACM - 1990