Automatically proving the correctness of compiler optimizations

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

Volumn , Issue , 2003, Pages 220-231

  Lerner, Sorin ^a   Millstein, Todd ^a   Chambers, Craig ^a  

^a University of Washington   (United States)

Author keywords

Automated correctness proofs; Compiler optimization

Indexed keywords

OPTIMIZATION; SEMANTICS; THEOREM PROVING;

POINTERS;

PROGRAM COMPILERS;

EID: 0038039859     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/781131.781156     Document Type: Conference Paper

References (35)

1. Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238-252, Los Angeles CA, January 1977.
2. Patrick Cousot and Radhia Cousot. Systematic design of program analysis frameworks. In Conference Record of the Sixth ACM Symposium on Principles of Programming Languages, pages 269-282, San Antonio TX, January 1979.
3. Patrick Cousot and Radhia Cousot. Systematic design of program transformation frameworks by abstract interpretation. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002.
4. Jeffrey Dean, Greg DeFouw, Dave Grove, Vassily Litvinov, and Craig Chambers. Vortex: An optimizing compiler for object-oriented languages. In Proceedings of the 1996 ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 83-100, San Jose CA, October 1996.
5. E.M. Clarke and E.A. Emerson. Synthesis of Synchronization Skeletons for Branching Time Temporal Logic. In Logics of Programs: Workshop, volume 131 of Lecture Notes in Computer Science, Yorktown Heights, New York, May 1981. Springer-Verlag.
6. Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. In Proceedings of the ACM SIGPLAN '02 Conference on Programming Language Design and Implementation, June 2002.
7. Dov Gabbay, Amir Pnueli, Saharon Shelah, and Jonathan Stavi. On the temporal analysis of fairness. In Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 163-173, Las Vegas, Nevada, 1980.
8. J. Guttman, J. Ramsdell, and M. Wand. VLISP: a verified implementation of Scheme. Lisp and Symbolic Compucation, 8(1-2):33-110, 1995.
9. 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.
10. Jens Knoop, Oliver Růthing, and Bernhard Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, 16(4):1117-1155, July 1994.
11. David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002.
12. Sorin Lerner, David Grove, and Craig Chambers. Composing dataflow analyses and transformations. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002.
13. Sorin Lerner, Todd Millstein, and Craig Chambers. Automatically proving the correctness of compiler optimizations. Technical Report UW-CSE-02-11-02, University of Washington, November 2002.
14. J. McCarthy and J. Painter. Correctness of a compiler for arithmetic expressions. In T. J. Schwartz, editor, Proceedings of Symposia in Applied Mathematics, January 1967.
15. E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Communications of the ACM, 22(2):96-103, February 1979.
16. F. Lockwood Morris. Advice on structuring compilers and proving them correct. In Conference Record of the 1st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston MA, January 1973.
17. Greg Morrisett, Karl Crary, Neal Glew, Dan Grossman, Richard Samuels, Frederick Smith, David Walker, Stephanie Weirich, and Steve Zdancewic. TALx86: A realistic typed assembly language. In 1999 ACM SIGPLAN Workshop on Compiler Support for System Software, pages 25-35, Atlanta GA, May 1999.
18. Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From System F to Typed Assembly Language. ACM Transactions on Programming Languages and Systems, 21(3):528-569, May 1999.
19. George C. Necula. Proof-carrying code. In Conference Record of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, France, January 1997.
20. George C. Necula. Translation validation for an optimizing compiler. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 83-95, Vancouver, Canada, June 2000.
21. George C. Necula and Peter Lee. The design and implementation of a certifying compiler. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998.
22. George C. Necula and Peter Lee. Proof generation in the Touchstone theorem prover. In Proceedings of the International Conference on Automated Deduction, pages 25-44, Pittsburgh, Pennsylvania, June 2000. Springer-Verlag LNAI 1831.
23. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, October 1979.
24. D. P. Oliva, J. Ramsdell, and M. Wand. The VLISP verified PreScheme compiler. Lisp and Symbolic Computation, 8(1-2):111-182, 1995.
25. S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M.K. Srivas. PVS: Combining specification, proof checking, and model checking. In Computer-Aided Verification, CAV '96, volume 1102 of Lecture Notes in Computer Science, pages 411-414, New Brunswick, NJ, July/August 1996. Springer-Verlag.
26. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In Tools and Algorithms for Construction and Analysis of Systems, TACAS '98, volume 1384 of Lecture Notes in Computer Science, pages 151-166, 1998.
27. Martin Rinard. Credible compilation. Technical Report MIT-LCS-TR-776, Massachusetts Institute of Technology, March 1999.
28. Martin Rinard and Darko Marinov. Credible compilation. In Proceedings of the FLoC Workshop Run-Time Result Verification, July 1999.
29. David A. Schmidt. Dataflow analysis is model checking of abstract interpretations. In Conference Record of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego CA, January 1998.
30. David A. Schmidt and Bernhard Steffen. Data flow analysis as model checking of abstract interpretations. In Giorgio Levi, editor, Proceedings of the 5th International Symposium on Static Analysis (SAS), volume 1503 of Lecture Notes in Computer Science (LNCS), pages 351-380. Springer-Verlag, September 1998.
31. Simplify automatic theorem prover home page, http://research.compaq.com/SRC/esc/Simplify.html.
32. Bernhard Steffen. Data flow analysis as model checking. In T. Ito and A.R. Meyer, editors, Theoretical Aspects of Computer Science (TACS), Sendai (Japan), volume 526 of Lecture Notes in Computer Science (LNCS), pages 346-364. Springer-Verlag, September 1991.
33. Bernhard Steffen. Generating dataflow analysis algorithms for model specifications. Science of Computer Programming, 21(2):115-139, 1993.
34. David Tarditi, Greg Morrisett, Perry Cheng, Chris Stone, Robert Harper, and Peter Lee. TIL: A type-directed optimizing compiler for ML. In Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation, Philadelphia PA, May 1996.
35. William D. Young. A mechanically verified code generator. Journal of Automated Reasoning, 5(4):493-518, December 1989.