A structured approach to proving compiler optimizations based on dataflow analysis

Authors:
Yves Bertot;Benjamin Grégoire;Xavier Leroy
Affiliations:
Projet MARELLE, INRIA Sophia-Antipolis, France;Projet EVEREST, INRIA Sophia-Antipolis, France;Projet CRISTAL, INRIA Rocquencourt, France
Venue:
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Year:
2004

Citing 6
Cited 11

Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Translation Validation

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Verified bytecode verifiers

Theoretical Computer Science - Foundations of software science and computation structures
Automated soundness proofs for dataflow analyses and transformations via local rules

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

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
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves

Journal of Automated Reasoning
Building Certified Static Analysers by Modular Construction of Well-founded Lattices

Electronic Notes in Theoretical Computer Science (ENTCS)
Formal certification of code-based cryptographic proofs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Certificate translation for optimizing compilers

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

Journal of Automated Reasoning
An intermediate representation approach to reducing test suites for retargeted compilers

Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Formal verification of an optimizing compiler

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
An automated approach to reducing test suites for testing retargeted C compilers for embedded systems

Journal of Systems and Software
A uniform and certified approach for two static analyses

TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Code optimizations using formally verified properties

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports on the correctness proof of compiler optimizations based on data-flow analysis. We formulate the optimizations and analyses as instances of a general framework for data-flow analyses and transformations, and prove that the optimizations preserve the behavior of the compiled programs. This development is a part of a larger effort of certifying an optimizing compiler by proving semantic equivalence between source and compiled code.