Translation validation for an optimizing compiler
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
We describe a translation validation infrastructure for the GNU C compiler. During the compilation the infrastructure compares the intermediate form of the program before and after each compiler pass and verifies the preservation of semantics. We discuss a general framework that the optimizer can use to communicate to the validator what transformations were performed. Our implementation however does not rely on help from the optimizer and it is quite successful by using instead a few heuristics to detect the transformations that take place.
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
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
Pnueli, A., Siegel, M., & Singerman, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054170 · Cited by 499
The design and implementation of a certifying compiler
Necula, G. C., & Lee, P. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277752 · Cited by 358
Self-citationTIL: a type-directed optimizing compiler for ML
Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., & Lee, P. (1996) · Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation · doi:10.1145/231379.231414 · Cited by 317
TALx86: A Realistic Typed Assembly Language∗
Morrisett, G., Crary, K., Glew, N., Grossman, D., Samuels, R. J., Frederick Smith, Y., Walker, D., Weirich, S., & Zdancewic, S. (1999) · Cited by 183
A certifying compiler for Java
Colby, C., Lee, P., Necula, G. C., Blau, F., Plesko, M., & Cline, K. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349315 · Cited by 183
Self-citationNecula, G. C., & Lee, P. (1998) · Cited by 174
Self-citationTowards Rigorous Compiler Implementation Verification
Goerigk, W., & Simon, F. (1999) · Lecture notes in computer science · doi:10.1007/10703260_4 · Cited by 10
Cited by
Formal verification of a realistic compiler
Leroy, X. (2009) · Communications of the ACM · doi:10.1145/1538788.1538814 · Cited by 1,187
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
Static Analysis of Executables to Detect Malicious Patterns
Christodorescu, M., & Jha, S. (2006) · doi:10.21236/ada449067 · Cited by 600
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2021) · 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) · doi:10.1109/cgo51591.2021.9370308 · Cited by 541
A Formally Verified Compiler Back-end
Leroy, X. (2009) · Journal of Automated Reasoning · doi:10.1007/s10817-009-9155-4 · Cited by 503
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
“C; H.3.4 [Programming Languages]: Processors—compilers General Terms Algorithms, Languages, Reliability, Verification Keywords Compiler testing, miscompilation, equivalent program variants, automated testing”
InfluentialSimple relational correctness proofs for static analyses and program transformations
Benton, N. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964003 · Cited by 356
Advanced Topics in Types and Programming Languages
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/1104.001.0001 · Cited by 348
WYSINWYX: What you see is not what you eXecute
Balakrishnan, G., & Reps, T. (2010) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1749608.1749612 · Cited by 286
SD3: 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
TASO: optimizing deep learning computation with automatic generation of graph substitutions
Jia, Z., Padon, O., Thomas, J., Warszawski, T., Zaharia, M., & Aiken, A. (2019) · Proceedings of the 27th ACM Symposium on Operating Systems Principles · doi:10.1145/3341301.3359630 · Cited by 261
Semantic program alignment for equivalence checking
Churchill, B., Padon, O., Sharma, R., & Aiken, A. (2019) · Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3314221.3314596 · Cited by 97
“We believe techniques that depend on syntactic alignment of the two programs [13, 14, 26, 27, 32] fail on most or all of our benchmarks, including at least 47 benchmarks where loop unrolling has been performed (usually as part of vectorization).”
BackgroundMethodInfluentialAutomated clustering and program repair for introductory programming assignments
Gulwani, S., Radiček, I., & Zuleger, F. (2018) · ACM SIGPLAN Notices · doi:10.1145/3296979.3192387 · Cited by 82
Verifix: Verified Repair of Programming Assignments
Ahmed, U. Z., Fan, Z., Yi, J., Al-Bataineh, O. I., & Roychoudhury, A. (2022) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3510418 · Cited by 42
Metadata
- Authors
- Necula, G. C.
- Venue
- Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 2000-05
- Pages
- 83-94
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2040856861
- Cited by
- 488
- References
- 8
- FWCI
- 9.58
- 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.