Code motion and code placement: Just synonyms?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1381, Issue , 1998, Pages 154-169

  Knoop, Jens ^a   Riithing, Oliver ^b   Steffen, Bernhard ^b  

^a UNIVERSITY OF PASSAU   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Code motion; Code placement; Data flow analysis; Herbrand interpretation; Partial redundancy elimination; Program optimization; Transparent equivalence

Indexed keywords

CODE CONVERTERS; DATA FLOW ANALYSIS; SEMANTICS; SYNTACTICS;

CODE MOTION; CODE PLACEMENT; HERBRAND INTERPRETATIONS; PARTIAL REDUNDANCY ELIMINATIONS; PROGRAM OPTIMIZATION; TRANSPARENT EQUIVALENCE;

CODES (SYMBOLS);

EID: 33645600362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053569     Document Type: Conference Paper

References (21)

1. B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In Conf. Rec. 15th Symp. Principles of Prog. Lang. (POPL’88), pages 1-11. ACM, NY, 1988.
2. F. Chow. A Portable Machine Independent Optimizer-Design and Measurements. PhD thesis, Stanford Univ., Dept, of Electrical Eng., Stanford, CA, 1983. Publ. as Tech. Rep. 83-254, Comp. Syst. Lab., Stanford Univ.
3. C. Click. Global code motion/global value numbering. In Proc. ACM SIGPLAN Conf. Prog. Lang. Design and Impl. (PLDF95), volume 30,6 of ACM SIGPLAN Not., pages 246-257, 1995.
4. J. Cocke and J. T. Schwartz. Programming languages and their compilers. Courant Inst. Math. Sciences, NY, 1970.
5. D. M. Dhamdhere. A fast algorithm for code movement optimization. ACM SIGPLAN Not., 23(10):172-180, 1988.
6. D. M. Dhamdhere. Practical adaptation of the global optimization algorithm of Morel and Renvoise. ACM Trans. Prog. Lang. Syst., 13(2):291-294, 1991. Tech. Corr.
7. D. M. Dhamdhere, B. K. Rosen, and F. K. Zadeck. How to analyze large programs efficiently and informatively. In Proc. ACM SIGPLAN Conf. Prog. Lang. Design and Impl. (PLDI’92), volume 27,7 of ACM SIGPLAN Not., pages 212-223, 1992.
8. K.-H. Drechsler and M. P. Stadel. A solution to a problem with Morel and Ren-voise’s “Global optimization by suppression of partial redundancies”. ACM Trans. Prog. Lang. Syst., 10(4):635-640, 1988. Tech. Corr.
9. A. Fong, J. B. Kam, and J. D. Ullman. Application of lattice algebra to loop optimization. In Conf. Rec. 2nd Symp. Principles of Prog. Lang. (POPL’75), pages 1-9. ACM, NY, 1975.
10. G. A. Kildall. A unified approach to global program optimization. In Conf. Rec. 1st Symp. Principles of Prog. Lang. (POPL’73), pages 194-206. ACM, NY, 1973.
11. J. Knoop, D. Koschiitzki, and B. Steffen. Basic-block graphs: Living dinosaurs? In Proc. 7th Int. Conf. on Compiler Constr. (CG’98), LNCS, Springer-V., 1998.
12. J. Knoop, O. Riithing, and B. Steffen. Lazy code motion. In Proc. ACM SIGPLAN Conf. Prog. Lang. Design and Impl. (PLDI’92), volume 27,7 of ACM SIGPLAN Not., pages 224-234, 1992.
13. J. Knoop, O. Riithing, and B. Steffen. Optimal code motion: Theory and practice. ACM Trans. Prog. Lang. Syst., 16(4):1117-1155, 1994.
14. J. Knoop, O. Riithing, and B. Steffen. Code Motion and Code Placement: Just Synonyms? Technical Report MIP-9716, Fakultat fiir Mathematik und Informatik, Universitat Passau, Germany, 1997.
15. E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Comm. ACM, 22(2):96-103, 1979.
16. J. H. Reif and R. Lewis. Symbolic evaluation and the global value graph. In Conf. Rec. 4th Symp. Principles of Prog. Lang. (POPL’77), pages 104-118. ACM, NY, 1977.
17. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In Conf. Rec. 15th Symp. Principles ofProq. Lanq. (POPL’88), pages 2-27. ACM, NY, 1988.
18. A. Sorkin. Some comments on a solution to a problem with Morel and Renvoise’s “Global optimization by suppression of partial redundancies”. ACM Trans. Prog. Lang. Syst., 11(4):666-668, 1989. Tech. Corr.
19. B. Steffen. Property-oriented expansion. In Proc. 3rd Stat. Analysis Symp. (SAS’96), LNCS 1145, pages 22-41. Springer-V., 1996.
20. B. Steffen, J. Knoop, and O. Riithing. The value flow graph: A program representation for optimal program transformations. In Proc. 3rd Europ. Symp. Programming (ESOP’90), LNCS 432, pages 389-405. Springer-V., 1990.
21. B. Steffen, J. Knoop, and O. Riithing. Efficient code motion and an adaption to strength reduction. In Proc. 4th Int. Conf. Theory and Practice of Software Development (TAPSOFT’91), LNCS 494, pages 394-415. Springer-V., 1991.