Efficient accommodation of may-alias information in SSA form

This publication has 13 references indexed in Scilit:

• A safe approximate algorithm for interprocedural aliasing
  Published by Association for Computing Machinery (ACM) ,1992
• Efficiently computing static single assignment form and the control dependence graph
  ACM Transactions on Programming Languages and Systems, 1991
• Constant propagation with conditional branches
  ACM Transactions on Programming Languages and Systems, 1991
• Automatic construction of sparse data flow evaluation graphs
  Published by Association for Computing Machinery (ACM) ,1991
• Analysis of pointers and structures
  ACM SIGPLAN Notices, 1990
• Parallelizing programs with recursive data structures
  IEEE Transactions on Parallel and Distributed Systems, 1990
• Detecting conflicts between structure accesses
  ACM SIGPLAN Notices, 1988
• Detecting equality of variables in programs
  Published by Association for Computing Machinery (ACM) ,1988
• A fast algorithm for finding dominators in a flowgraph
  ACM Transactions on Programming Languages and Systems, 1979
• Efficiency of a Good But Not Linear Set Union Algorithm
  Journal of the ACM, 1975