Paul R. Carini, Michael Hind
ACM SIGPLAN Notices
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.
Paul R. Carini, Michael Hind
ACM SIGPLAN Notices
Vijay Arya, Rachel Bellamy, et al.
CODS-COMAD 2021
Martin Hirzel, Daniel Von Dincklage, et al.
ACM TOPLAS
Martin Hirzel, Johannes Henkel, et al.
ISMM 2002