Vijay Arya, Rachel Bellamy, et al.
JMLR
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.
Vijay Arya, Rachel Bellamy, et al.
JMLR
Dries Buytaert, Andy Georges, et al.
OOPSLA 2007
Bor-Ming Hsieh, Michael Hind, et al.
ACM/IEEE SC 1992
Michael Burke
ACM Transactions on Programming Languages and Systems (TOPLAS)