A framework for formal verification of compiler optimizations

Authors:
William Mansky;Elsa Gunter
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Year:
2010

Citing 13
Cited 3

Detecting equality of variables in programs

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A mechanically verified language implementation

Journal of Automated Reasoning
Building program optimizers with rewriting strategies

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Proving correctness of compiler optimizations by temporal logic

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of branching time

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating-time temporal logic

Journal of the ACM (JACM)
Analysis and Optimization of Explicitly Parallel Programs Using the Parallel Program Graph Representation

LCPC '97 Proceedings of the 10th International Workshop on Languages and Compilers for Parallel Computing
Translation Validation

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Modern Compiler Implementation in ML

Modern Compiler Implementation in ML
Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formal verification of translation validators: a case study on instruction scheduling optimizations

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program transformations using temporal logic side conditions

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Formally Verified Compiler Back-end

Journal of Automated Reasoning

A formally verified SSA-Based middle-end: Static single assignment meets compcert

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Formal verification of SSA-based optimizations for LLVM

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Formal Verification of an SSA-Based Middle-End for CompCert

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we describe a framework for formally verifying the correctness of compiler optimizations. We begin by giving formal semantics to a variation of the TRANS language [6], which is designed to express optimizations as transformations on control-flow graphs using temporal logic side conditions. We then formalize the idea of correctness of a TRANS optimization, and prove general lemmas about correctness that can form the basis of a proof of correctness for a particular optimization. We present an implementation of the framework in Isabelle, and as a proof of concept, demonstrate a proof of correctness of an algorithm for converting programs into static single assignment form.