Bringing extensibility to verified compilers

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

Volumn , Issue , 2010, Pages 111-121

  Tatlock, Zachary ^a   Lerner, Sorin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

compiler optimization; correctness; extensibility

Indexed keywords

COMPILER CORRECTNESS; COMPILER OPTIMIZATIONS; COQ PROOF ASSISTANT; CORRECTNESS PROOFS; DOMAIN SPECIFIC; DOMAIN SPECIFIC LANGUAGES; END-TO-END CORRECTNESS; EXECUTION ENGINE; INTERACTIVE PROOF ASSISTANTS; LESSONS LEARNED; PROGRAM SEMANTICS; PROOF DEVELOPMENT; PROOF OF CORRECTNESS; TRUSTED COMPUTING BASE;

C (PROGRAMMING LANGUAGE); COBALT; COMPUTER AIDED SOFTWARE ENGINEERING; LINGUISTICS; OPTIMIZATION; PROBLEM ORIENTED LANGUAGES; RHODIUM;

PROGRAM COMPILERS;

EID: 77954715631     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806596.1806611     Document Type: Conference Paper

References (18)

1. N. Benton and N. Tabareau. Compiling functional types to relational specifications for low level imperative code. In TLDI, 2009.
2. A. Chlipala. A certified type-preserving compiler from lambda calculus to assembly language. In PLDI, 2007.
3. A. Chlipala. A verified compiler for an impure functional language. In POPL, 2010.
4. L. de Moura and N. Bjørner. Z3: An efficient SMT solver. In TACAS, 2008.
5. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005.
6. S. Z. Guyer and C. Lin. Broadway: A compiler for exploiting the domain-specific semantics of software libraries. Proceedings of IEEE, 93(2), 2005.
7. S. Kundu, Z. Tatlock, and S. Lerner. Proving optimizations correct using parameterized program equivalence. In PLDI, 2009.
8. S. Lerner, T. Millstein, E. Rice, and C. Chambers. Automated soundness proofs for dataflow analyses and transformations via local rules. In POPL, 2005.
9. X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In POPL, 2006.
10. G. C. Necula. Translation validation for an optimizing compiler. In PLDI, 2000.
11. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. In TACAS, 1998.
12. M. Rinard and D. Marinov. Credible compilation with pointers. In Workshop on Run-Time Result Verification, 1999.
13. S. Sarkar, P. Sewell, F. Z. Nardelli, S. Owens, T. Ridge, T. Braibant, M. O. Myreen, , and J. Alglave. The semantics of x86-cc multiprocessor machine code. In POPL, 2009.
14. J.-B. Tristan and X. Leroy. Formal verification of translation validators: A case study on instruction scheduling optimizations. In POPL, 2008.
15. J.-B. Tristan and X. Leroy. Verified validation of lazy code motion. In PLDI, 2009.
16. J.-B. Tristan and X. Leroy. A simple, verified validator for software pipelining. In POPL, 2010.
17. D. L. Whitfield and M. L. Soffa. An approach for exploring code improving transformations. ACM Transactions on Programming Languages and Systems, 19(6):1053-1084, Nov. 1997.
18. L. Zuck, A. Pnueli, B. Goldberg, C. Barrett, Y. Fang, and Y. Hu. Translation and run-time validation of loop transformations. Form. Methods Syst. Des., 27(3):335-360, 2005.