Formal Verification of Compiler Transformations on Polychronous Equations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Formal Verification of Compiler Transformations on Polychronous Equations

Abstract

In this paper, adopting the translation validation approach, we present a formal verification process to prove the correctness of compiler transformations on systems of polychronous equations. We encode the source programs and the transformations with polynomial dynamical systems and prove that the transformations preserve the abstract clocks and clock relations of the source programs. In order to carry out the correctness proof, an appropriate relation called refinement and an automated proof method are presented. Each individual transformation or optimization step of the compiler is followed by our validation process which proves the correctness of this running. The compiler will continue its work if and only if the correctness is proved positively. In this paper, the highly optimizing, industrial compiler from the synchronous language SIGNAL to C is addressed.
Fichier principal
Vignette du fichier
ifm12.pdf (241.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00730393 , version 1 (10-09-2012)

Identifiers

  • HAL Id : hal-00730393 , version 1

Cite

van Chan Ngo, Loic Besnard, Thierry Gautier, Paul Le Guernic, Jean-Pierre Talpin. Formal Verification of Compiler Transformations on Polychronous Equations. International Conference on Integrated Formal Methods, CNR/ISTI Italy, Jun 2012, Pisa, Italy. ⟨hal-00730393⟩
212 View
178 Download

Share

Gmail Facebook X LinkedIn More