Dynamic compilation: The benefits of early investing
Prasad Kulkarni, Matthew Arnold, et al.
VEe 2007
We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework for interprocedural pointer alias analysis that handles function pointers by constructing the program call graph while alias analysis is being performed; (2) a flow-sensitive interprocedural pointer alias analysis algorithm; (3) a flow-insensitive interprocedural pointer alias analysis algorithm; (4) a flow-insensitive interprocedural pointer alias analysis algorithm that incorporates kill information to improve precision; (5) empirical measurements of the efficiency and precision of the three interprocedural alias analysis algorithms.
Prasad Kulkarni, Matthew Arnold, et al.
VEe 2007
Dz-Ching R. Ju, Paul Carini
IEEE TPDS
Frances Allen, Michael Burke, et al.
Journal of Parallel and Distributed Computing
Michael Burke, Ron Cytron
SIGPLAN Symposium on Compiler Construction 1986