论文信息 - Code Motion

Code Motion

Original Program P improved Program P') FIG. 1. A simple example of code motion. To insure that P' is semantically equivalent to the original program P, we require that if node w is the movept of t, then: R1. All control paths from the start node s to loc(t) contain node w. R2. The computation is possible at node w; i.e., all quantities required for the computation must be properly defined at node w.

John H. Reif

[1] Charles Matthew Geschke,et al. Global program optimizations. , 1973 .

[2] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[3] R. Tarjan. Solving path problems on directed graphs. , 1975 .

[4] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[5] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[6] Mark N. Wegman,et al. A Fast and Usually Linear Algorithm for Global Flow Analysis , 1976, J. ACM.

[7] John H. Reif,et al. Symbolic evaluation and the global value graph , 1977, POPL.

[8] Robert E. Tarjan. Testing flow graph reducibility , 1973, STOC '73.

[9] Christopher Earnest,et al. Some Topics in Code Optimization , 1974, JACM.

[10] Robert E. Tarjan,et al. A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[11] Alfred V. Aho,et al. Principles of Compiler Design , 1977 .

[12] Jeffrey D. Ullman,et al. Flow graph reducibility , 1972, SIAM J. Comput..

[13] John H. Reif. Symbolic program analysis in almost linear time , 1978, POPL '78.