The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Abstract
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a C-like imperative language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a certified compiler is useful in the context of formal methods applied to the certification of critical software: the certification 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
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
Cited by
Klein, G., Elphinstone, K., Heiser, G., Andronick, J., Cock, D., Derrin, P., Elkaduwe, D., Engelhardt, K., Kolanski, R., Norrish, M., et al. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629596 · Cited by 1,633
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
A FORMAL PROOF OF THE KEPLER CONJECTURE
HALES, T., ADAMS, M., BAUER, G., DANG, T. D., HARRISON, J., HOANG, L. T., KALISZYK, C., MAGRON, V., MCLAUGHLIN, S., NGUYEN, T. T., et al. (2017) · Forum of Mathematics, Pi · doi:10.1017/fmp.2017.1 · Cited by 342
Industrial Use of Formal Methods for a High-Level Security Evaluation
Chetali, B., & Nguyen, Q.-H. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68237-0_15 · Cited by 21
A theory of platform-dependent low-level software
Nita, M., Grossman, D., & Chambers, C. (2008) · Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1328438.1328465 · Cited by 16
Metadata
- Authors
- Leroy, X.
- Venue
- Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2006-01-11
- Pages
- 42-54
- OpenAlex
- W2129695855
- Cited by
- 661
- References
- 1
- FWCI
- 43.94
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. https://app.cochat.ai/papers/10.1145/1111037.1111042
- The paper
- Leroy, X. (2006). Formal certification of a compiler back-end or: programming a compiler with a proof assistant. Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/1111037.1111042
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.
