Fast, Fine-Grained Equivalence Checking for Neural Decompilers

Luke Dramko, Claire Le Goues, Edward J. Schwartz
1/8/2025
cs.LGcs.CRcs.SE

No confident code implementation found for this paper.

Abstract

Neural decompilers are machine learning models that reconstruct the source code from an executable program. Critical to the lifecycle of any machine learning model is an evaluation of its effectiveness. However, existing techniques for evaluating neural decompilation models have substantial weaknesses, especially when it comes to showing the correctness of the neural decompiler's predictions. To address this, we introduce codealign, a novel instruction-level code equivalence technique designed for neural decompilers. We provide a formal definition of a relation between equivalent instructions, which we term an equivalence alignment. We show how codealign generates equivalence alignments, then evaluate codealign by comparing it with symbolic execution. Finally, we show how the information codealign provides-which parts of the functions are equivalent and how well the variable names match-is substantially more detailed than existing state-of-the-art evaluation metrics, which report unitless numbers measuring similarity.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dramko2025fast,
  title  = {Fast, Fine-Grained Equivalence Checking for Neural Decompilers},
  author = {Luke Dramko and Claire Le Goues and Edward J. Schwartz},
  year   = {2025},
  eprint = {2501.04811},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.04811v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.04811.svg)](https://codeofpaper.com/paper/2501.04811)

Discussion