Paper Info
Title
A static heap analysis for shape and connectivity: unified memory analysis: the base framework
Abstract
Modeling the evolution of the state of program memory during program execution is critical to many parallelization techniques. Current memory analysis techniques either provide very accurate information but run prohibitively slowly or produce very conservative results. An approach based on abstract interpretation is presented for analyzing programs at compile time, which can accurately determine many important program properties such as aliasing, logical data structures and shape. These properties are known to be critical for transforming a single threaded program into a version that can be run on multiple execution units in parallel. The analysis is shown to be of polynomial complexity in the size of the memory heap. Experimental results for benchmarks in the Jolden suite are given. These results show that in practice the analysis method is efficient and is capable of accurately determining shape information in programs that create and manipulate complex data structures.
Year
DOI
Venue
2006
10.1007/978-3-540-72521-3_25
LCPC
Keywords
DocType
Volume
current memory analysis technique,important program property,accurate information,memory heap,program memory,analysis method,logical data structure,unified memory analysis,program execution,static heap analysis,complex data structure,single threaded program,base framework,data structure,complex data
Conference
4382
ISSN
Citations 
PageRank 
0302-9743
7
0.52
References 
Authors
16
4
Name
Order
Citations
PageRank
Mark Marron11249.74
Deepak Kapur22282235.00
Darko Stefanovic370.52
Manuel V. Hermenegildo42692182.60