How to analyze large programs efficiently and informatively

This publication has 14 references indexed in Scilit:

• Efficiently computing static single assignment form and the control dependence graph
  ACM Transactions on Programming Languages and Systems, 1991
• Practical adaption of the global optimization algorithm of Morel and Renvoise
  ACM Transactions on Programming Languages and Systems, 1991
• Some comments on “A solution to a problem with Morel and Renvoise's 'Global optimization by suppression of partial redundancies'”
  ACM Transactions on Programming Languages and Systems, 1989
• An efficient method of computing static single assignment form
  Published by Association for Computing Machinery (ACM) ,1989
• A fast algorithm for code movement optimisation
  ACM SIGPLAN Notices, 1988
• A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
  ACM Transactions on Programming Languages and Systems, 1988
• Incremental data flow analysis in a structured program editor
  ACM SIGPLAN Notices, 1984
• Global optimization by suppression of partial redundancies
  Communications of the ACM, 1979
• On Live-Dead Analysis for Global Data Flow Problems
  Journal of the ACM, 1977
• A Simple Algorithm for Global Data Flow Analysis Problems
  SIAM Journal on Computing, 1975