Cited by 97Logic, programming, and type systemsSoftware Testing and Debugging TechniquesFormal Methods in Verification

Semantic program alignment for equivalence checking

Churchill, Berkeley, Padon, Oded, Sharma, Rahul, Aiken, Alex·2019·Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation

Abstract

We introduce a robust semantics-driven technique for program equivalence checking. Given two functions we find a trace alignment over a set of concrete executions of both programs and construct a product program particularly amenable to checking equivalence.

Integrity signals

Registry

Crossref · 10.1145/3314221.3314596

Cites

46 of 46 references verified0 citation errors · 0 not checkable

Statistics

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

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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?

  • Searching semantically equivalent code requires extra code compilation and execution costs, which is unrealistic in a large database.

    “Searching semantically equivalent code requires extra code compilation and execution costs (Massalin, 1987; Churchill et al., 2019), which is unrealistic in a large database.”

    From ReACC: A Retrieval-Augmented Code Completion Framework (2022) · cites this paper as Churchill et al., 2019

Cites

Flagged first, then by citations

1 of the 47 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Churchill, B., Padon, O., Sharma, R., & Aiken, A.
Affiliations
  • Stanford University (US)
  • Microsoft Research (India) (IN)
Venue
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher
ACM
Published
2019-06-08
Pages
1027-1040
ISSN
1531-7102 (ISSN-L)
OpenAlex
W2954725723
Cited by
97
References
47
Citations by year
2026: 8 · 2025: 20 · 2024: 10 · 2023: 15 · 2022: 12 · 2021: 17 · 2020: 9 · 2019: 6
FWCI
4.21
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (publishedVersion)
Funders
National Science Foundation
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
Keywords
program equivalence checking, trace alignment, product programs, program semantics, program verification

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