Record Details

Heap reference analysis using access graphs

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Heap reference analysis using access graphs
 
Creator KHEDKER, UDAY P
SANYAL, AMITABHA
KARKARE, AMEY
 
Subject graph theory
computer programming
data flow analysis
random processes
 
Description Despite significant progress in the theory and practice of program analysis, analyzing properties of heap data has not reached the same level of maturity as the analysis of static and stack data. The spatial and temporal structure of stack and static data is well understood while that of heap data seems arbitrary and is unbounded. We devise bounded representations that summarize properties of the heap data. This summarization is based on the structure of the program that manipulates the heap. The resulting summary representations are certain kinds of graphs called access graphs. The boundedness of these representations and the monotonicity of the operations to manipulate them make it possible to compute them through data flow analysis.
 
Publisher Association for Computing Machinery
 
Date 2009-06-20T06:32:14Z
2011-12-08T08:09:42Z
2011-12-26T13:02:38Z
2011-12-27T05:49:14Z
2009-06-20T06:32:14Z
2011-12-08T08:09:42Z
2011-12-26T13:02:38Z
2011-12-27T05:49:14Z
2007
 
Type Article
 
Identifier ACM Transactions on Programming Languages and Systems (TOPLAS) 30(1), 1-41
0164-0925
10.1145/1290520.1290521
http://hdl.handle.net/10054/1541
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1541
 
Language en