Compiler validation via equivalence modulo inputs
The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Abstract
We introduce equivalence modulo inputs (EMI), a simple, widely applicable methodology for validating optimizing compilers. Our key insight is to exploit the close interplay between (1) dynamically executing a program on some test inputs and (2) statically compiling the program to work on all possible inputs. Indeed, the test inputs induce a natural collection of the original program's EMI variants, which can help differentially test any compiler and specifically target the difficult-to-find miscompilations.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This paper demonstrates that modern titanic LLMs can be leveraged to directly perform both generation-based and mutation-based fuzzing studied for decades, while being fully automated, generalizable, and applicable to domains challenging for traditional approaches (such as DL systems).”
From Large Language Models Are Zero-Shot Fuzzers: Fuzzing Deep-Learning Libraries via Large Language Models (2023) · cites this paper as [39]
In the citing paper
“Moreover, to our knowledge, we are the first to apply infilling models (e.g., InCoder) to directly perform mutation-based fuzzing [39,50] to generate more diverse input programs in an evolutionary fuzzing loop.”
From Large Language Models Are Zero-Shot Fuzzers: Fuzzing Deep-Learning Libraries via Large Language Models (2023) · cites this paper as [39]
Citations
Cites
Finding and understanding bugs in C compilers
Yang, X., Chen, Y., Eide, E., & Regehr, J. (2011) · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1993498.1993532 · Cited by 825 · cited 3×
“Others, however, can cause compilers to silently miscompile a program and produce wrong code, subverting the programmer’s intent.”
BackgroundInfluentialFormal 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 · cited 3×
“Compiler Testing The most directly related is compiler testing, which remains the dominant technique for validating production compilers in practice.”
BackgroundMethodInfluentialFinding and understanding bugs in C compilers
Yang, X., Chen, Y., Eide, E., & Regehr, J. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993532 · Cited by 586
A Formally Verified Compiler Back-end
Leroy, X. (2009) · Journal of Automated Reasoning · doi:10.1007/s10817-009-9155-4 · Cited by 503
Pnueli, A., Siegel, M., & Singerman, E. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054170 · Cited by 499 · cited 1×
“C; H.3.4 [Programming Languages]: Processors—compilers General Terms Algorithms, Languages, Reliability, Verification Keywords Compiler testing, miscompilation, equivalent program variants, automated testing”
InfluentialTranslation 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 · cited 1×
“C; H.3.4 [Programming Languages]: Processors—compilers General Terms Algorithms, Languages, Reliability, Verification Keywords Compiler testing, miscompilation, equivalent program variants, automated testing”
Influential(1998) · Cited by 469
Test-case reduction for C compiler bugs
Regehr, J., Chen, Y., Cuoq, P., Eide, E., Ellison, C., & Yang, X. (2012) · Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2254064.2254104 · Cited by 310
Holler, C., Herzig, K., & Zeller, A. (2012) · Cited by 275
Superoptimizer: a look at the smallest program
Massalin, H. (1987) · ACM SIGPLAN Notices · doi:10.1145/36205.36194 · Cited by 221
Equality saturation: a new approach to optimization
Tate, R., Stepp, M., Tatlock, Z., & Lerner, S. (2009) · Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1480881.1480915 · Cited by 193 · cited 1×
“introduce the Peggy optimization and translation validation framework for JVM based on equality saturation [25].”
MethodAn executable formal semantics of C with applications
Ellison, C., & Rosu, G. (2012) · ACM SIGPLAN Notices · doi:10.1145/2103621.2103719 · Cited by 188
An executable formal semantics of C with applications
Ellison, C., & Rosu, G. (2012) · Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/2103656.2103719 · Cited by 169 · cited 1×
“The information presented here does not necessarily reflect the position or the policy of the Government and no official endorsement should be inferred.”
BackgroundAutomatic generation of peephole superoptimizers
Bansal, S., & Aiken, A. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168906 · Cited by 161
Superoptimizer: a look at the smallest program
Massalin, H. (1987) · Proceedings of the second international conference on Architectual support for programming languages and operating systems · doi:10.1145/36206.36194 · Cited by 154 · cited 1×
“Extending work on super-optimization [3, 11, 15], in particular Denali [11], Tate et al.”
Denali: a goal-directed superoptimizer
Joshi, R., Nelson, G., & Randall, K. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512566 · Cited by 151 · cited 2×
“Extending work on super-optimization [3, 11, 15], in particular Denali [11], Tate et al. introduce the Peggy optimization and translation validation framework for JVM based on equality saturation [25].”
Chen, Y., Groce, A., Zhang, C., Wong, W.-K., Fern, X., Eide, E., & Regehr, J. (2013) · Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2491956.2462173 · Cited by 145 · cited 2×
“for (b = 0; b < 2; b++) a[b + 4][c] = a[c][0]; printf("%d\n", a[4][4]);”
BackgroundToward a verified relational database management system
Malecha, G., Morrisett, G., Shinnar, A., & Wisnesky, R. J. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706329 · Cited by 132 · cited 1×
“In particular, there is some early work toward building a verified relational database management system [14].”
BackgroundGroce, A., Zhang, C., Eide, E. N., Chen, Y., & Regehr, J. D. (2012) · International Symposium on Software Testing and Analysis · doi:10.1145/2338965.2336763 · Cited by 119 · cited 1×
“The information presented here does not necessarily reflect the position or the policy of the Government and no official endorsement should be inferred.”
BackgroundFormal verification of SSA-based optimizations for LLVM
Zhao, J., Nagarakatte, S., Martin, M. M. K., & Zdancewic, S. (2013) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2491956.2462164 · Cited by 93 · cited 1×
“[30] on a proof technique to verify SSA-based optimizations in LLVM using the Coq proof assistant.”
MethodEvaluating value-graph translation validation for LLVM
Tristan, J.-B., Govereau, P., & Morrisett, G. (2011) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1993498.1993533 · Cited by 83 · cited 1×
“[27] adapt the work and evaluate it on validating intra-procedural optimizations in LLVM.”
MethodTesting Static Analyzers with Randomly Generated Programs
Cuoq, P., Monate, B., Pacalet, A., Prévosto, V., Regehr, J. D., Yakobowski, B., & Yang, X. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28891-3_12 · Cited by 76 · cited 3×
“We follow C-Reduce [24] and leverage (1) GCC and LLVM warnings, (2) KCC [6], and (3) static analysis tools such as Frama-C.6 We also utilize Clang’s (although imperfect) support for undefined behavior sanitization, as well as cross-checking using a few different compilers and compiler 5 The “Tiny C Compiler” (http://b…”
MethodInfluentialEvaluating value-graph translation validation for LLVM
Tristan, J.-B., Govereau, P., & Morrisett, G. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993533 · Cited by 71
The Verifying Compiler: A Grand Challenge for Computing Research
Hoare, C. A. R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45209-6_1 · Cited by 50
Automated test program generation for an industrial optimizing compiler
Zhao, C., Xue, Y., Tao, Q., Guo, L., & Wang, Z. (2009) · International Workshop on Automation of Software Test (AST) · doi:10.1109/iwast.2009.5069039 · Cited by 40 · cited 1×
“[29] develop JTT, a tool that automatically generates test programs to validate the EC++ embedded compiler.”
MethodRandom Testing of C Compilers Targeting Arithmetic Optimization
Nagai, E., Awazu, H., Ishiura, N., & Takeda, N. (2012) · Cited by 24
The Verifying Compiler: A Grand Challenge for Computing Research
Hoare, T. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45213-3_4 · Cited by 23
Nagai, E., Hashimoto, A., & Ishiura, N. (2013) · Cited by 20
Research works printed but not linked: 2
- 10.5555/2362793.2362831 · doi:10.5555/2362793.2362831
- 10.5555/646482.691453 · doi:10.5555/646482.691453
Cited by
Machine Learning Testing: Survey, Landscapes and Horizons
Zhang, J. M., Harman, M., Ma, L., & Liu, Y. (2022) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2019.2962027 · Cited by 897
Metamorphic Testing: A Review of Challenges and Opportunities
Chen, T. Y., Kuo, F.-C., Liu, H., Poon, P.-L., Towey, D., Tse, T. H., & Zhou, Z. Q. (2019) · ACM Computing Surveys · doi:10.1145/3143561 · Cited by 665
“detect hundreds of real-life bugs in two popular compilers [50] is strong evidence that identication of good MRs may not be dicult at all.”
InfluentialA Survey on Metamorphic Testing
Segura, S., Fraser, G., Sanchez, A. B., & Ruiz-Cortes, A. (2016) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2016.2532875 · Cited by 563
“A closely related idea was presented by Le et al. [119].”
BackgroundDeng, Y., Xia, C. S., Peng, H., Yang, C., & Zhang, L. (2023) · Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3597926.3598067 · Cited by 326
“Additionally, TitanFuzz is the rst work to demonstrate that LLMs can perform both generation-based [30, 80] and mutation-based [39, 50] fuzzing studied for decades [84], while being fully automated, generalizable, and applicable to domains challenging for traditional approaches (such as DL systems).”
BackgroundMethodVerdi: a framework for implementing and formally verifying distributed systems
Wilcox, J. R., Woos, D., Panchekha, P., Tatlock, Z., Wang, X., Ernst, M. D., & Anderson, T. (2015) · Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2737924.2737958 · Cited by 270
“The CompCert C compiler [22] was verified in Coq and repeatedly shown to be more reliable than traditionally developed compilers [21, 41].”
Method
Metadata
- Authors
- Le, V., Afshari, M., & Su, Z.
- Affiliations
- University of California, Davis (US)
- ORCID
- Venue
- Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2014-06-09
- Pages
- 216-226
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2170737051
- Cited by
- 388
- References
- 28
- Citations by year
- 2026: 25 · 2025: 28 · 2024: 39 · 2023: 33 · 2022: 25 · 2021: 38 · 2020: 46 · 2019: 31 · 2018: 33 · 2017: 25 · 2016: 38 · 2015: 25 · 2014: 2
- FWCI
- 19.85
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (publishedVersion)
- Funders
- National Science Foundation (0917392, 1117603, 1319187, 1349528)
- Topics
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Keywords
- compiler validation, differential testing, optimizing compilers, test data generation, program variants, compiler correctness
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.