Towards a formally verified obfuscating compiler - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Towards a formally verified obfuscating compiler


This paper extends the idea of specializing modified interpreters for systematically generating obfuscated code. By using the Coq proof assistant we specify some elementary obfuscations and prove that the resulting distorted interpreter is correct, namely it preserves the intended semantics of programs. The paper shows how the semantic preservation proofs generated and verified in Coq can provide a measure of the quality of the obfuscation. In particular we can observe that there is a precise corresponding between the potency of the obfuscation and the complexity of the proof of semantics preservation. Our obfuscation can be easily integrated into the CompCert C compiler, providing the basis for a formally verified obfuscating compiler which can be applied to any C program.
Fichier principal
Vignette du fichier
paper-ieee.pdf (60.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00762330 , version 1 (08-12-2012)


  • HAL Id : hal-00762330 , version 1


Sandrine Blazy, Roberto Giacobazzi. Towards a formally verified obfuscating compiler. SSP 2012 - 2nd ACM SIGPLAN Software Security and Protection Workshop, ACM SIGPLAN, Jun 2012, Beijing, China. ⟨hal-00762330⟩
381 View
142 Download


Gmail Facebook X LinkedIn More