Efficient accommodation of may-alias information in SSA form
Authors:
Open Access
- 1 June 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 28 (6) , 36-45
Abstract
We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our method over exhaustive use of may-alias information, as optimization problems converge well before most may-aliases are needed.Keywords
This publication has 14 references indexed in Scilit:
- Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects1993
- A safe approximate algorithm for interprocedural aliasing1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- Automatic construction of sparse data flow evaluation graphs1991
- Analysis of pointers and structuresACM SIGPLAN Notices, 1990
- Parallelizing programs with recursive data structuresIEEE Transactions on Parallel and Distributed Systems, 1990
- The Perfect Club Benchmarks: Effective Performance Evaluation of SupercomputersThe International Journal of Supercomputing Applications, 1989
- Detecting conflicts between structure accessesACM SIGPLAN Notices, 1988
- Detecting equality of variables in programs1988
- LINPACK Users' Guide1979