The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The design and implementation of a certifying compiler
Open accessAbstract
This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly language programs, and a certifier that automatically checks the type safety and memory safety of any assembly language program produced by the compiler. The result of the certifier is either a formal proof of type safety or a counterexample pointing to a potential violation of the type system by the target program. The ensemble of the compiler and the certifier is called a certifying compiler.Several advantages of certifying compilation over previous approaches can be claimed. The notion of a certifying compiler is significantly easier to employ than a formal compiler verification, in part because it is generally easier to verify the correctness of the result of a computation than to prove the correctness of the computation itself. Also, the approach can be applied even to highly optimizing compilers, as demonstrated by the fact that our compiler generates target code, for a range of realistic C programs, which is competitive with both the cc and gcc compilers with all optimizations enabled. The certifier also drastically improves the effectiveness of compiler testing because, for each test case, it statically signals compilation errors that might otherwise require many executions to detect. Finally, this approach is a practical way to produce the safety proofs for a Proof-Carrying Code system, and thus may be useful in a system for safe mobile code.
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
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
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
Self-citationPVS: A prototype verification system
Owre, S., Rushby, J. M., & Shankar, N. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55602-8_217 · Cited by 1,415
A framework for defining logics
Harper, R., Honsell, F., & Plotkin, G. (1993) · Journal of the ACM · doi:10.1145/138027.138060 · Cited by 990
Simplification by Cooperating Decision Procedures
Nelson, G., & Oppen, D. C. (1979) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357073.357079 · Cited by 908
Boyer, R. S., & Moore, J. S. (1979) · Cited by 883
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
Safe kernel extensions without run-time checking
Necula, G. C., & Lee, P. (1996) · Proceedings of the second USENIX symposium on Operating systems design and implementation · doi:10.1145/238721.238781 · Cited by 505
Self-citationPnueli, A., Siegel, M., & Singerman, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054170 · Cited by 499
Cited by
Schneider, F. B. (2000) · ACM Transactions on Information and System Security · doi:10.1145/353323.353382 · Cited by 1,289
Dynamically discovering likely program invariants to support program evolution
Ernst, M. D., Cockrell, J., Griswold, W. G., & Notkin, D. (2001) · IEEE Transactions on Software Engineering · doi:10.1109/32.908957 · Cited by 1,050
Flicker: an execution infrastructure for tcb minimization
McCune, J. M., Parno, B. J., Perrig, A., Reiter, M. K., & Isozaki, H. (2008) · Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 · doi:10.1145/1352592.1352625 · Cited by 640
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
Self-citationSD3: a trust management system with certified evaluation
Jim, T. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924291 · Cited by 273
Metadata
- Authors
- Necula, G. C., & Lee, P.
- Venue
- Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 1998-05
- Pages
- 333-344
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2051632385
- Cited by
- 358
- References
- 18
- FWCI
- 27.64
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: The design and implementation of a certifying compiler. https://app.cochat.ai/papers/10.1145/277650.277752
- The paper
- Necula, G. C., & Lee, P. (1998). The design and implementation of a certifying compiler. Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation. https://doi.org/10.1145/277650.277752
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.