Disproving Program Equivalence with LLMs
Not on the map. Why?
Abstract (arXiv)
To evaluate large language models (LLMs) for code, research has used manually created unit test-based benchmarks. However, these tests are often inadequate, missing corner cases and other implementation-specific oddities. This work introduces ProbeGen, a whitebox method that takes two or more executable pieces of code and searches for counterexamples to their equivalence. Comparing code semantics requires a deep understanding of code. We demonstrate that LLMs with execution feedback perform well at this task. In a common code synthesis benchmark, ProbeGen disproves 18% of samples considered equivalent to the ground truth by the benchmark-provided unit tests. Additionally, using ProbeGen, we can semantically cluster LLM samples for semantic self-consistency, improving pass@1 by 10% by unifying syntactically distinct but semantically similar samples.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 11 of its 21 references that are in the map. First posted on arXiv 5 Feb 2025.
Builds on
11 of 21 references.
References · 11
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
- 2023Teaching Large Language Models to Self-Debugcited by 988
- 2022CodeT: Code Generation with Generated Testscited by 384
- 2023Universal Self-Consistency for Large Language Model Generationcited by 203
- 2024Automated Unit Test Improvement using Large Language Models at Metacited by 75
- 2024On Leakage of Code Generation Evaluation Datasetscited by 32
- 2024SemCoder: Training Code Language Models with Comprehensive Semantics Reasoningcited by 27
- 2024ChangeGuard: Validating Code Changes via Pairwise Learning-Guided Executioncited by 6
- 2021Self-Supervised Learning to Prove Equivalence Between Straight-Line Programs via Rewrite Rulescited by 3
Built on by
Citing papers per year: 2025: 2; 2026: 3.
5 papers.
- 2025From Code Foundation Models to Agents and Applications: A Comprehensive Survey and Practical Guide to Code Intelligencecited by 15
- 2026Scaling Agentic Verifier for Competitive Codingcited by 7
- 2025Towards Verified Code Reasoning by LLMscited by 4
- 2026Barriers to Discrete Reasoning with Transformers: A Survey Across Depth, Exactness, and Bandwidthcited by 3
- 2026How Robustly do LLMs Understand Execution Semantics?cited by 2
- 2026How Robustly do LLMs Understand Execution Semantics?24 Feb 2026
- 2026Scaling Agentic Verifier for Competitive Coding4 Feb 2026
- 2026Barriers to Discrete Reasoning with Transformers: A Survey Across Depth, Exactness, and Bandwidth19 Jan 2026
- 2025From Code Foundation Models to Agents and Applications: A Comprehensive Survey and Practical Guide to Code Intelligence23 Nov 2025
- 2025Towards Verified Code Reasoning by LLMs30 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2025EquiBench: Benchmarking Large Language Models' Reasoning about Program Semantics via Equivalence Checking
- 2026Evaluating Language Models on Cross-Language Code Functional Equivalence
- 2025Can LLMs Reason About Program Semantics? A Comprehensive Evaluation of LLMs on Formal Specification Inference
- 2026Inferring Code Correctness from Specification
- 2025CoRe: Benchmarking LLMs Code Reasoning Capabilities through Static Analysis Tasks
- 2025LLM4VV: Evaluating Cutting-Edge LLMs for Generation and Evaluation of Directive-Based Parallel Programming Model Compiler Tests ↗
- 2025Beyond Synthetic Benchmarks: Evaluating LLM Performance on Real-World Class-Level Code Generation
- 2026An Execution-Verified Multi-Language Benchmark for Code Semantic Reasoning