No abstract

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.

No abstract

Recently, there has been an emphasis on analyzing programs in languages with pointers and recursive structures. A principal difficulty in developing these analyses appears to be incorporating the effects of pointer-induced aliasing. Two algorithms for general pointer-induced aliasing have recently been developed [LR92,CBC93]. This report clarifies discussions of this problem and the comparison between the two algorithms.

Absstncct-We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on thii scheme that efficiently determines when it is beneficial to fuse any two primitives. Experhentnl results show that five LINPACK routines report 50% performance improvement from the fusion of array operators.