D-LiFT: Improving LLM-based Decompiler Backend via Code Quality-driven Fine-tuning
Not on the map. Why?
Abstract (arXiv)
As one of the key tools in many security tasks, decompilers reconstruct human-readable source code from binaries. Yet, despite recent advances, their outputs often suffer from syntactic and semantic errors and remain difficult to read. Recently, with the advent of large language models (LLMs), researchers began to explore the potential of LLMs to refine decompiler output. Nevertheless, our study of these approaches reveals their problems, such as introducing new errors and relying on unreliable accuracy validation. In this paper, we present D-LIFT, an enhanced decompiler-LLM pipeline with a fine-tuned LLM using code quality-aware reinforcement learning. Unlike prior work that overlooks preserving accuracy, D-LIFT adheres to a key principle for enhancing the quality of decompiled code: preserving accuracy while improving readability. Central to D-LIFT, we propose D-Score, an integrated code quality assessment system to score the decompiled source code from multiple aspects, and use it to guide reinforcement learning fine-tuning and to select the best output during inference. In line with our principle, D-Score assigns low scores to any inaccurate output and only awards higher scores for readability to code that passes the accuracy check. Our implementation, based on Ghidra and a range of LLMs, demonstrates significant improvements for the accurate decompiled code from the coreutils and util-linux projects. Compared to baseline LLMs without D-Score-driven fine-tuning, our trained LLMs produce 55.3% more improved decompiled functions, as measured by D-Score. Overall, D-LIFT improves the quality of 68.2% of all the functions produced by the native decompiler.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Jun 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026CoDe-R: Refining Decompiler Output with LLMs via Rationale Guidance and Adaptive Inferencecited by 1
- 2026PCodeTrans: Translate Decompiled Pseudocode to Compilable and Executable Equivalentcited by 0
- 2026ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coveragecited by 0
- 2026Decomposer: Learning to Decompile Symbolic Music to Programscited by 0
- 2026When LLM Decompilers Recompile More and Preserve Lesscited by 0
- 2026When LLM Decompilers Recompile More and Preserve Less4 Sep 2026
- 2026Decomposer: Learning to Decompile Symbolic Music to Programs2 Jul 2026
- 2026ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage20 May 2026
- 2026CoDe-R: Refining Decompiler Output with LLMs via Rationale Guidance and Adaptive Inference14 Apr 2026
- 2026PCodeTrans: Translate Decompiled Pseudocode to Compilable and Executable Equivalent16 Mar 2026