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-citationFrom 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
Resources, concurrency, and local reasoning
O’Hearn, P. W. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.035 · Cited by 552
Pnueli, A., Siegel, M., & Singerman, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054170 · Cited by 499
Modern Compiler Implementation in Java
Appel, A. W., & Palsberg, J. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511811432 · Cited by 498
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
(1998) · Cited by 469
HUET, G. (1997) · Journal of Functional Programming · doi:10.1017/s0956796897002864 · Cited by 314
Foundational proof-carrying code
Appel, A. W. (2002) · Proceedings 16th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2001.932501 · Cited by 308
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
Coinductive big-step operational semantics
Leroy, X., & Grall, H. (2008) · Information and Computation · doi:10.1016/j.ic.2007.12.004 · Cited by 177
Self-citationMechanized Semantics for the Clight Subset of the C Language
Blazy, S., & Leroy, X. (2009) · Journal of Automated Reasoning · doi:10.1007/s10817-009-9148-3 · Cited by 162
Self-citationFormal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
Leroy, X., & Blazy, S. (2008) · Journal of Automated Reasoning · doi:10.1007/s10817-008-9099-0 · Cited by 159
Self-citationJava Bytecode Verification: Algorithms and Formalizations
Leroy, X. (2003) · Journal of Automated Reasoning · doi:10.1023/a:1025055424017 · Cited by 150
Self-citationFormal Verification of a C Compiler Front-End
Blazy, S., Dargaye, Z., & Leroy, X. (2006) · Lecture notes in computer science · doi:10.1007/11813040_31 · Cited by 145
Self-citationAutomated 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
Java Program Verification via a Hoare Logic with Abrupt Termination
Huisman, M., & Jacobs, B. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46428-x_20 · Cited by 119
Stack-based typed assembly language
Morrisett, G., Crary, K., Glew, N., & Walker, D. (2002) · Journal of Functional Programming · doi:10.1017/s0956796801004178 · Cited by 101
Proving correctness of compiler optimizations by temporal logic
Lacey, D., Jones, N. D., Wyk, E. V., & Frederiksen, C. C. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503299 · Cited by 98
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
Volatiles are miscompiled, and what to do about it
Eide, E. N., & Regehr, J. D. (2008) · ACM International Conference on Embedded Software (EMSOFT) · doi:10.1145/1450058.1450093 · Cited by 80
Formalizing the safety of Java, the Java virtual machine, and Java card
Hartel, P., & Moreau, L. (2001) · ACM Computing Surveys · doi:10.1145/503112.503115 · Cited by 79
Random testing of C calling conventions
Lindig, C. (2005) · International Symposium on Automated Analysis-Driven Debugging (AADEBUG) · doi:10.1145/1085130.1085132 · Cited by 71
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
An open framework for foundational proof-carrying code
Feng, X., Ni, Z., Shao, Z., & Guo, Y. (2007) · Types In Languages Design And Implementation · doi:10.1145/1190315.1190325 · Cited by 60
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
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 Polynomial-Time Algorithm for Global Value Numbering
Gulwani, S., & Necula, G. C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27864-1_17 · Cited by 45
A type system for certified binaries
Shao, Z., Trifonov, V., Saha, B., & Papaspyrou, N. (2005) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1053468.1053469 · Cited by 44
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-citationInterprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certifiés
Pichardie, D. (2005) · Cited by 35
Certificate translation for optimizing compilers
Barthe, G., Grégoire, B., Kunz, C., & Rezk, T. (2009) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1538917.1538919 · Cited by 22
Blech, 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
Type-preserving compilation for large-scale optimizing object-oriented compilers
Chen, J., Hawblitzel, C., Perry, F., Emmi, M., Condit, J., Coetzee, D., & Pratikaki, P. (2008) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1375581.1375604 · Cited by 21
Certificate Translation for Optimizing Compilers
Barthe, G., Grégoire, B., Kunz, C., & Rezk, T. (2006) · Lecture notes in computer science · doi:10.1007/11823230_20 · Cited by 20
Certificate Translation in Abstract Interpretation
Barthe, G., & Kunz, C. (2008) · Springer eBooks · doi:10.1007/978-3-540-78739-6_28 · Cited by 18
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
Formal verification of a realistic compiler
Leroy, X. (2009) · Communications of the ACM · doi:10.1145/1538788.1538814 · Cited by 1,187
Self-citationCompiler 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
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.