CoChat

Compiler validation via equivalence modulo inputs

Le, Vu, Afshari, Mehrdad, Su, Zhendong · 2014 · Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation

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

Crossref · 10.1145/2594291.2594334

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Research works printed but not linked: 2

  1. 10.5555/2362793.2362831 · doi:10.5555/2362793.2362831
  2. 10.5555/646482.691453 · doi:10.5555/646482.691453

Cited by

See all 426

Metadata

Authors
Le, V., Afshari, M., & Su, Z.
Affiliations
University of California, Davis (US)
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.