Faultless: A Program Equivalence Technique for Validating and Evaluating Neural Decompilers

arXiv:2609.34089 · cs.PL, cs.CR, cs.SE · Submitted 2026-09-28 · Read on arXiv

cs.PL, cs.CR, cs.SE

Submitted: 2026-09-28

Updated: 2026-09-28

Code: https://github.com/squaresLab/faultless

Terminology

Abstraction — 11× in this paper · explained in 1 episode
SMT solver — 11× in this paper · explained in 2 episodes
Accuracy — 8× in this paper · explained in 1 episode
Consistency — 8× in this paper · explained in 3 episodes
Verification — 8× in this paper · explained in 2 episodes
Addressability — 6× in this paper · explained in 1 episode
Fidelity — 4× in this paper · explained in 2 episodes
Benchmark — 3× in this paper · explained in 2 episodes
Trace — 3× in this paper · explained in 2 episodes
Transformer — 3× in this paper · explained in 2 episodes
Formal Methods — 2× in this paper · explained in 3 episodes
Aggregation — 1× in this paper · explained in 1 episode
Alignment — 1× in this paper · explained in 1 episode
Attention Mechanism — 1× in this paper · explained in 2 episodes
Axioms — 1× in this paper · explained in 2 episodes
Contrastive Learning — 1× in this paper · explained in 5 episodes
Core — 1× in this paper · explained in 2 episodes
Single Static Assignment — 1× in this paper
Transformer Models — 1× in this paper · explained in 2 episodes
Verifier — 1× in this paper · explained in 2 episodes

Sources

Fast, Fine-Grained Equivalence Checking for Neural Decompilers

Related papers