The DOI matches its Crossref record; 20 of the 20 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
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
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Pnueli, A., Siegel, M., & Singerman, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054170 · Cited by 499
Translation validation for an optimizing compiler
Necula, G. C. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349314 · Cited by 488
A machine-checked model for a Java-like language, virtual machine, and compiler
Klein, G., & Nipkow, T. (2006) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1146809.1146811 · Cited by 246
Automated soundness proofs for dataflow analyses and transformations via local rules
Lerner, S., Millstein, T. D., Rice, E., & Chambers, C. (2005) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1040305.1040335 · Cited by 139
The calculational design of a generic abstract interpreter
Cousot, P. M. (1999) · Cited by 135
Oracle-based checking of untrusted software
Necula, G. C., & Rahul, S. P. (2001) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/360204.360216 · Cited by 89
Extracting a data flow analyser in constructive logic
Cachera, D., Jensen, T. W., Pichardie, D., & Rusu, V. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.06.004 · Cited by 62
Symbolic transfer function-based approaches to certified compilation
Rival, X. (2004) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/964001.964002 · Cited by 58
Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certifiés
Pichardie, D. (2005) · Cited by 54
Zuck, L. D., Pnueli, A., Fang, Y., & Goldberg, B. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)80393-1 · Cited by 53
A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis
Bertot, Y., Grégoire, B., & Leroy, X. (2006) · Lecture notes in computer science · doi:10.1007/11617990_5 · Cited by 37
Self-citationFormal Verification of a Memory Model for C-Like Imperative Languages
Blazy, S., & Leroy, X. (2005) · Lecture notes in computer science · doi:10.1007/11576280_20 · Cited by 26
Self-citationBlech, J. O., Glesner, S., Leitner, J. J., & Mülling, S. (2005) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.02.042 · Cited by 22
Tool-Assisted Specification and Verification of the JavaCard Platform
Barthe, G., Courtieu, P., Dufay, G., & de Sousa, S. M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45719-4_4 · Cited by 14
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
Formal verification of a realistic compiler
Leroy, X. (2009) · Communications of the ACM · doi:10.1145/1538788.1538814 · Cited by 1,187
Self-citationA Formally Verified Compiler Back-end
Leroy, X. (2009) · Journal of Automated Reasoning · doi:10.1007/s10817-009-9155-4 · Cited by 503
Self-citationUnikernels: library operating systems for the cloud
Madhavapeddy, A., Mortier, R., Rotsos, C., Scott, D., Singh, B., Gazagnaire, T., Smith, S., Hand, S., & Crowcroft, J. (2013) · Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/2451116.2451167 · Cited by 400
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
“Compiler Testing The most directly related is compiler testing, which remains the dominant technique for validating production compilers in practice.”
BackgroundMethodInfluential
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
- 20
- 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
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.