Formal verification of SSA-based optimizations for LLVM

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

Volumn , Issue , 2013, Pages 175-186

  Zhao, Jianzhou ^a   Nagarakatte, Santosh ^b   Martin, Milo M K ^a   Zdancewic, Steve ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Coq; LLVM; Single static assignment

Indexed keywords

COMPILER OPTIMIZATIONS; COQ; COQ PROOF ASSISTANT; FORMAL VERIFICATIONS; INTERMEDIATE REPRESENTATIONS; LLVM; STATIC ASSIGNMENT; STATIC SINGLE ASSIGNMENTS;

COMPUTER PROGRAMMING LANGUAGES; OPTIMIZATION; PROGRAM COMPILERS;

THEOREM PROVING;

EID: 84883101134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2462156.2462164     Document Type: Conference Paper

References (22)

1. Static Single Assignment Book, 2012. Working draft available at http://ssabook.gforge.inria.fr/latest/book.pdf.
2. A. W. Appel. SSA is functional programming. SIGPLAN Not., 33(4): 17-20, April 1998. ISSN 0362-1340.
3. J. Aycock and N. Horspool. Simple generation of static single assignment form. In CC, 2000.
4. G. Barthe, D. Demange, and D. Pichardie. A formally verified SSA-based middle-end - Static Single Assignment meets CompCert. In ESOP, 2012.
5. J. O. Blech, S. Glesner, J. Leitner, and S. Mülling. Optimizing code generation from SSA form: A comparison between two formal correctness proofs in Isabelle/HOL. Electron. Notes Theor. Comput. Sci., 141(2):33-51, 2005.
6. The Coq Proof Assistant Reference Manual (Version 8.3pl1). The Coq Development Team, 2011.
7. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. TOPLAS, 13:451-490, 1991.
8. R. A. Kelsey. A correspondence between continuation passing style and static single assignment form. In IR, number 3, 1995.
9. X. Leroy. A formally verified compiler back-end. Journal of Automated Reasoning, 43(4):363-446, December 2009. ISSN 0168-7433.
10. The LLVM Reference Manual (Version 3.0). The LLVM Development Team, 2011. http://llvm.org/releases/3.0/docs/LangRef.html.
11. W. Mansky and E. L. Gunter. A framework for formal verification of compiler optimizations. In ITP, 2010.
12. Y. Matsuno and A. Ohori. A type system equivalent to static single assignment. In PPDP, 2006.
13. V. S. Menon, N. Glew, B. R. Murphy, A. McCreight, T. Shpeisman, A. Adl-Tabatabai, and L. Petersen. A verifiable SSA program representation for aggressive compiler optimization. In POPL, 2006.
14. S. S. Muchnick. Advanced compiler design and implementation. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1997. ISBN 1-55860-320-4.
15. V. C. Sreedhar and G. R. Gao. A linear time algorithm for placing φ-nodes. In POPL, 1995.
16. J.-B. Tristan and X. Leroy. Formal verification of translation validators: a case study on instruction scheduling optimizations. In POPL, 2008.
17. J.-B. Tristan and X. Leroy. Verified validation of lazy code motion. In PLDI, 2009.
18. J. B. Tristan and X. Leroy. A simple, verified validator for software pipelining. In POPL, 2010.
19. B. Yakobowski. Étude sémantique d'un langage intermédiaire de type Static Single Assignment. Rapport de dea (Master's thesis), ENS Cachan and INRIA Rocquencourt, Sept. 2004.
20. X. Yang, Y. Chen, E. Eide, and J. Regehr. Finding and understanding bugs in C compilers. In PLDI, 2011.
21. J. Zhao and S. Zdancewic. Mechanized verification of computing dominators for formalizing compilers. In CPP, 2012.
22. J. Zhao, S. Nagarakatte, M. M. K. Martin, and S. Zdancewic. Formalizing the LLVM intermediate representation for verified program transformations. In POPL, 2012.