Name
Abstract | ||
|---|---|---|
Programs in high level languages make intensive use of heap to support dynamic data structures. Analyzing these programs requires precise reasoning about the heap structures. Shape analysis refers to the class of techniques that statically approximate the run-time structures created on the heap. In this paper, we present a novel field sensitive shape analysis technique to identify the shapes of the heap structures. The novelty of our approach lies in the way we use field information to remember the paths that result in a particular shape (Tree, DAG, Cycle). We associate the field information with a shape in two ways: (a) through boolean functions that capture the shape transition due to change in a particular field, and (b) through matrices that store the field sensitive path information among two pointer variables. This allows us to easily identify transitions from Cycle to DAG, from Cycle to Tree and from DAG to Tree, thus making the shape more precise. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2245276.2231982 | ISSE |
Keywords | DocType | Volume |
pointer analysis,boolean function,shape analysis,high level language,static analysis | Conference | 9 |
Issue | ISSN | Citations |
2 | 1614-5054 | 3 |
PageRank | References | Authors |
0.41 | 19 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| sandeep dasgupta | 1 | 3 | 0.75 |
| amey karkare | 2 | 122 | 13.45 |