Paper Info
Title
Scalable flow-sensitive pointer analysis for java with strong updates
Abstract
The ability to perform strong updates is the main contributor to the precision of flow-sensitive pointer analysis algorithms. Traditional flow-sensitive pointer analyses cannot strongly update pointers residing in the heap. This is a severe restriction for Java programs. In this paper, we propose a new flow-sensitive pointer analysis algorithm for Java that can perform strong updates on heap-based pointers effectively. Instead of points-to graphs, we represent our points-to information as maps from access paths to sets of abstract objects. We have implemented our analysis and run it on several large Java benchmarks. The results show considerable improvement in precision over the points-to graph based flow-insensitive and flow-sensitive analyses, with reasonable running time.
Year
DOI
Venue
2012
10.1007/978-3-642-31057-7_29
ECOOP
Keywords
Field
DocType
points-to information,large java benchmarks,heap-based pointer,flow-sensitive pointer analysis algorithm,points-to graph,new flow-sensitive pointer analysis,flow-sensitive analysis,strong updates,traditional flow-sensitive pointer,scalable flow-sensitive pointer analysis,java program
Pointer analysis,Pointer (computer programming),Programming language,Function pointer,Escape analysis,Computer science,Real time Java,Theoretical computer science,Smart pointer,Pointer swizzling,Java
Conference
Volume
ISSN
Citations 
7313
0302-9743
14
PageRank 
References 
Authors
0.58
20
2
Name
Order
Citations
PageRank
Arnab De1271.93
Deepak D'souza223917.90