A Formally Verified Compiler Back-end

  title={A Formally Verified Compiler Back-end},
  author={Xavier Leroy},
  journal={Journal of Automated Reasoning},
This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its soundness. Such a verified compiler is useful in the context of formal methods applied to the certification of critical software: the verification of the compiler guarantees that the safety properties proved on the… CONTINUE READING
Highly Influential
This paper has highly influenced 42 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 383 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS


Publications citing this paper.
Showing 1-10 of 253 extracted citations

383 Citations

Citations per Year
Semantic Scholar estimates that this publication has 383 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 95 references

Compilation des termes de preuves: un (nouveau) mariage entre Coq et OCaml

  • B. Grégoire
  • Ph.D. thesis, University Paris 7 Diderot
  • 2003
Highly Influential
4 Excerpts

The Compcert verified compiler, software and commented proof

  • X. Leroy
  • Available at http://compcert.inria.fr/
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…