Proving optimizations correct using parameterized program equivalence

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2009, Pages 327-337

  Kundu, Sudipta ^a   Tatlock, Zachary ^a   Lerner, Sorin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compiler optimization; Correctness; Translation validation

Indexed keywords

COMPILER OPTIMIZATIONS; COMPLEX OPTIMIZATION; EQUIVALENCE CHECKING; INPUT AND OUTPUTS; LOOP FUSION; LOOP INTERCHANGE; LOOP UNROLLING; PARAMETERIZED; PROGRAM BEHAVIOR; PROGRAM EQUIVALENCE; REWRITE RULES; SOFTWARE PIPELINING; TRANSFORMATION RULES; TRANSLATION VALIDATION;

C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; EQUIVALENCE CLASSES; LINGUISTICS; OPTIMIZATION; PROGRAM COMPILERS; TRANSLATION (LANGUAGES);

PROGRAM TRANSLATORS;

EID: 70450225381     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542476.1542513     Document Type: Conference Paper

References (32)

1. Nick Benton. Simple relational correctness proofs for static analyses and and program transformations. In POPL, 2004.
2. David Cachera, Thomas Jensen, David Pichardie, and Vlad Rusu. Extracting a data flow analyser in constructive logic. In ESOP, 2004.
3. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, 1977.
4. Patrick Cousot and Radhia Cousot. Systematic design of program transformation frameworks by abstract interpretation. In POPL, 2002.
5. D. Detlefs, G. Nelson, and J. Saxe. Simplify: A theorem prover for program checking. Journal of the Association for Computing Machinery, 52(3):365-473, May 2005.
6. Benjamin Goldberg, Lenore Zuck, and Clark Barrett. Into the loops: Practical issues in translation validation for optimizing compilers. Electronic Notes in Theoretical Computer Science, 132(1):53-71, May 2005.
7. J. Guttman, J. Ramsdell, and M. Wand. VLISP: a verified implementation of Scheme. Lisp and Symbolic Compucation, 8(1-2):33-110, 1995.
8. M. Kauffmann and R.S. Boyer. The Boyer-Moore theorem prover and its interactive enhancement. Computers and Mathematics with Applications, 29(2):27-62, 1995.
9. Wayne Kelly and William Pugh. Finding legal reordering transformations using mappings. In Languages and Compilers for Parallel Computing, 1994.
10. Dexter Kozen. Kleene algebra with tests. ACM Transactions on Programming Langauges and Systems, 19(3):427-443, 1997.
11. Sudipta Kundu, Sorin Lerner, and Rajesh Gupta. Automated refinement checking of concurrent systems. In ICCAD, 2007.
12. Sudipta Kundu, Sorin Lerner, and Rajesh Gupta. Validating high-level synthesis. In Computer Aided Vefification (CAV), 2008.
13. David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In POPL, 2002.
14. Sorin Lerner, Todd Millstein, and Craig Chambers. Automatically proving the correctness of compiler optimizations. In PLDI, 2003.
15. Sorin Lerner, Todd Millstein, Erika Rice, and Craig Chambers. Automated soundness proofs for dataflow analyses and transformations via local rules. In POPL, 2005.
16. Xavier Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In POPL, 2006.
17. R. Milner. Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989.
18. S. Muchnick. Advanced Compiler Design And Implementation. Morgan Kaufmann Publishers, 1997.
19. G. Necula. Translation validation for an optimizing compiler. In PLDI, June 2000.
20. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In TACAS, 1998.
21. William Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:4-13, 1992.
22. Martin Rinard and Darko Marinov. Credible compilation. In Proceedings of the FLoC Workshop Run-Time Result Verification, July 1999.
23. Martin C. Rinard and Pedro C. Diniz. Commutativity analysis: a new analysis framework for parallelizing compilers. In PLDI, 1996.
24. Ganesh Sittampalam, Oege de Moor, and Ken Friis Larsen. Incremental execution of transformation specifications. In POPL, 2004.
25. Bernhard Steffen. Data flow analysis as model checking. In Theoretical Aspects of Computer Science, volume 526 of Lecture Notes in Computer Science, pages 346-364. Springer-Verlag, September 1991.
26. Steven W. K. Tjiang and John L. Hennessy. Sharlit - a tool for building optimizers. In PLDI, 1992.
27. Jean-Baptiste Tristan and Xavier Leroy. Verified validation of lazy code motion. In POPL, 2008.
28. Jean-Baptiste Tristan and Xavier Leroy. Formal verification of translation validators: a case study on instruction scheduling optimizations. In PLDI, 2009.
29. Deborah L. Whitfield and Mary Lou Soffa. An approach for exploring code improving transformations. ACM Transactions on Programming Languages and Systems, 19(6):1053-1084, November 1997.
30. Kwangkeun Yi and Williams Ludwell Harrison III. Automatic generation and management of interprocedural program analyses. In POPL, 1993.
31. William D. Young. A mechanically verified code generator. Journal of Automated Reasoning, 5(4):493-518, December 1989.
32. Lenore Zuck, Amir Pnueli, Benjamin Goldberg, Clark Barrett, Yi Fang, and Ying Hu. Translation and run-time validation of loop transformations. Form. Methods Syst. Des., 27(3):335-360, 2005.