Efficient loop-level parallelism in Ada
Michael Hind, Edmond Schonberg
TRI-Ada 1991
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.
Michael Hind, Edmond Schonberg
TRI-Ada 1991
Wai-Mee Ching, Paul Carini, et al.
Computer Languages
Matthew Arnold, Stephen J. Fink, et al.
Proceedings of the IEEE
Stephen M. Blackburn, Amer Diwan, et al.
ACM TOPLAS