A structured approach to proving compiler optimizations based on dataflow analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

A structured approach to proving compiler optimizations based on dataflow analysis

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.
Fichier principal
Vignette du fichier
proofs_dataflow_optimizations.pdf (159.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00289549 , version 1 (21-06-2008)

Identifiers

Cite

Yves Bertot, Benjamin Grégoire, Xavier Leroy. A structured approach to proving compiler optimizations based on dataflow analysis. Types for Proofs and Programs, Workshop TYPES 2004, Dec 2004, Jouy-en-Josas, France. pp.66-81, ⟨10.1007/11617990⟩. ⟨inria-00289549⟩
174 View
254 Download

Altmetric

Share

Gmail Facebook X LinkedIn More