DMCA
Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis (2003)
| Citations: | 10 - 1 self |
BibTeX
@TECHREPORT{Lattner03datastructure,
author = {Chris Lattner and Vikram Adve},
title = {Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis},
institution = {},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper describes a scalable heap analysis algorithm, Data Structure Analysis, designed to enable analyses and transformations of programs at the level of entire logical data structures. Data Structure Analysis attempts to identify disjoint instances of logical program data structures and their internal and external connectivity properties (without trying to categorize their "shape"). To achieve this, Data Structure Analysis is fully context-sensitive (in the sense that it names memory objects by entire acyclic call paths), is fieldsensitive, builds an explicit model of the heap, and is robust enough to handle the full generality of C.
