Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers

Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers (0)

Cached

Download Links

[www.mcs.newpaltz.edu]

Other Repositories/Bibliography

DBLP

by Michael Burke , Paul Carini , Jong-deok Choi , Michael Hind

Citations:

66 - 17 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Languages and Compilers for Parallel Computing Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers	SVM HeaderParse 0.1
AUTHOR NAME	Michael Burke	SVM HeaderParse 0.1
AUTHOR AFFIL	IBM T. J. Watson Research Center	SVM HeaderParse 0.2
AUTHOR NAME	Paul Carini	SVM HeaderParse 0.1
AUTHOR AFFIL	IBM T. J. Watson Research Center	SVM HeaderParse 0.2
AUTHOR NAME	Jong-deok Choi	SVM HeaderParse 0.1
AUTHOR AFFIL	IBM T. J. Watson Research Center	SVM HeaderParse 0.2
AUTHOR NAME	Michael Hind	SVM HeaderParse 0.1
AUTHOR AFFIL	State University of New York at New Paltz; IBM T. J. Watson Research Center	SVM HeaderParse 0.2
ABSTRACT	Abstract. Data-flow analysis algorithms can be classified into two categories: flow-sensitive and flow-insensitive. To improve efficiency, flowinsensitive interprocedural analyses do not make use of the intraprocedural control flow information associated with individual procedures. Since pointer-induced aliases can change within a procedure, applying known flow-insensitive analyses can result in either incorrect or overly conservative solutions. In this paper, we present a flow-insensitive dataflow analysis algorithm that computes interprocedural pointer-induced aliases. We improve the precision of our analysis by (1) making use of certain types of kill information that can be precomputed efficiently, and (2) computing aliases generated in each procedure instead of holding at the exit of each procedure. We improve the efficiency of our algorithm by introducing a technique called deferred evaluation. Interprocedural analyses, including alias analysis, rely upon the program call graph (PCG) for their correctness and precision. The PCG becomes incomplete or overly imprecise in the presence of function pointers. This paper also describes a method for constructing the PCG in the presence of function pointers. 1	SVM HeaderParse 0.1
CITATIONS	34 found	ParsCit 1.0