The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
A Formally Verified Compiler Back-end
Open accessAbstract
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 source code hold for the executable compiled code as well.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
Interactive Theorem Proving and Program Development
Bertot, Y., & Castéran, P. (2004) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/978-3-662-07964-5 · Cited by 1,353
Castéran, P., & Bertot, Y. (2004) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 1,084
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Necula, G. C., McPeak, S., Rahul, S. P., & Weimer, W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_16 · Cited by 977
A unified approach to global program optimization
Kildall, G. A. (1973) · Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73 · doi:10.1145/512927.512945 · Cited by 916
Register allocation & spilling via graph coloring
Chaitin, G. J. (1982) · ACM SIGPLAN Notices · doi:10.1145/872726.806984 · Cited by 767
Register allocation & spilling via graph coloring
Chaitin, G. J. (1982) · Proceedings of the 1982 SIGPLAN symposium on Compiler construction - SIGPLAN '82 · doi:10.1145/800230.806984 · Cited by 666
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Leroy, X. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111042 · Cited by 661
Self-citation
Cited by
Compiler validation via equivalence modulo inputs
Le, V., Afshari, M., & Su, Z. (2014) · Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2594291.2594334 · Cited by 388
Using Crash Hoare logic for certifying the FSCQ file system
Chen, H., Ziegler, D., Chajed, T., Chlipala, A., Kaashoek, M. F., & Zeldovich, N. (2015) · Proceedings of the 25th Symposium on Operating Systems Principles · doi:10.1145/2815400.2815402 · Cited by 211
Metadata
- Authors
- Leroy, X.
- Venue
- Journal of Automated Reasoning
- Published
- 2009-11-04
- Volume
- 43
- Issue
- 4
- Pages
- 363-446
- ISSN
- 0168-7433 (ISSN-L)
- 1573-0670
- OpenAlex
- W2148662736
- Cited by
- 503
- References
- 46
- FWCI
- 28.55
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Formally Verified Compiler Back-end. https://app.cochat.ai/papers/10.1007/s10817-009-9155-4
- The paper
- Leroy, X. (2009). A Formally Verified Compiler Back-end. Journal of Automated Reasoning. https://doi.org/10.1007/s10817-009-9155-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
