GIVE-N-TAKE—a balanced code placement framework

This publication has 25 references indexed in Scilit:

• An elimination algorithm for bidirectional data flow problems using edge placement
  ACM Transactions on Programming Languages and Systems, 1993
• Practical adaption of the global optimization algorithm of Morel and Renvoise
  ACM Transactions on Programming Languages and Systems, 1991
• Properties of data flow frameworks
  Acta Informatica, 1990
• 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
• Register assignment using code placement techniques
  Computer Languages, 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
• Elimination algorithms for data flow analysis
  ACM Computing Surveys, 1986
• Characterization of program loops in code optimization
  Computer Languages, 1983
• Global optimization by suppression of partial redundancies
  Communications of the ACM, 1979
• A Fast and Usually Linear Algorithm for Global Flow Analysis
  Journal of the ACM, 1976