- Efficient Accommodation of May-Alias Information in SSA Form
- 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.
- Proceedings of ACM SIGPLAN '93 Conference on Programming Design and
Implementation, pages 36-45, June 1993.
For more information contact: