Imperative program optimization by partial evaluation

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2004, Pages 113-122

  Debois, Søren ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Bisimulation; Code duplication; Loop invariant code motion; Strength reduction

Indexed keywords

APPROXIMATION THEORY; COMPUTER PROGRAM LISTINGS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; PARAMETER ESTIMATION; PROGRAM INTERPRETERS;

BISIMULATION; CODE DUPLICATION; LOOP-INVARIANT CODE MOTION; STRENGTH REDUCTION;

OPTIMIZATION;

EID: 11244269333     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014007.1014019     Document Type: Conference Paper

References (15)

1. N. Benton. Simple relational correctness proofs for static analyses and program transformations. In Proceedings of the 31st ACM Symposium On Principles of Programming Languages (POPL04), 2004.
2. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, 1977.
3. P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758-771, 1980.
4. R. Glück and J. Jørgensen. Generating optimizing specializers. In IEEE International Conference On Computer Languages, pages 183-194. IEEE Computer Society Press, 1994.
5. R. Glück and J. Jørgensen. Generating transformers for deforestation and supercompilation. In B. Le Charlier, editor. Static Analysis, volume 864 of Lecture Notes in Computer Science, pages 432-448. Springer-Verlag, 1994.
6. G. K. Gomard and N. D. Jones. Compiler generation by partial evaluation: a case study. Structured Programming, 12:123-144, 1991.
7. N. D. Jones. Transformation by interpreter specialisation. Science of Computer Programming, pages 1-40, 2004. accepted for publication.
8. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall International, 1993.
9. D. Lacey, N. D. Jones, E. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proceedings of the 29Th Annual ACM Symposium On Principles of Programming Languages (POPL02), pages 283-294. ACM Press, 2002.
10. S. Lerner, T. Millstein, and C. Chambers. Automatically proving the correctness of compiler optimizations. In ACM SIGPLAN Conference On Programming Language Design and Implementation (PLDI 2003), pages 220-231. ACM Press, 2003.
11. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.
12. S. S. Muchnick. Advanced Compiler Design & Implementation. Morgan Kaufmann Publishers, 1997.
13. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal On Computing, 16(6):973-989, Dec. 1987.
14. M. Sperber and P. Thiemann. Realistic compilation by partial evaluation. In ACM SIGPLAN '96 Conference On Programming Language Design and Implementation, Philadelphia, Pennsylvania, May 1996 (SIGPLAN Notices, Vol. 31, No. 5), pages 206-214. New York: ACM, 1996.
15. S. Thibault, C. Consel, J. L. Lawall, R. Marlet, and G. Muller. Static and dynamic program compilation by interpreter specialization. Higher-Order and Symbolic Computation, 13(3):161-178, 2000.