@inproceedings{wang-etal-2026-icl4decomp,
title = "{ICL}4{D}ecomp: Towards Re-executable Reverse Engineering",
author = "Wang, Xiaohan and
Hu, Yuxin and
Leach, Kevin",
editor = "Lee, Hung-Yi and
Dev, Sunipa and
Li, Jessy and
Elliott, Desmond",
booktitle = "Findings of the {A}ssociation for {C}omputational {L}inguistics: {EMNLP} 2026",
month = oct,
year = "2026",
address = "Budapest, Hungary",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2026.findings-emnlp.1542/",
pages = "32819--32832",
ISBN = "979-8-89176-462-0",
abstract = "Binary decompilation, which aims to recover source code from compiled binaries, can be viewed as a low-resource and high-constraint form of neural machine translation. However, existing decompilation techniques often fail to produce source code that can be successfully recompiled and re-executed, particularly for optimized binaries. Recent advances in large language models (LLMs) have enabled neural approaches to decompilation, but the generated code is typically only semantically plausible rather than truly executable, limiting their practical reliability. These shortcomings arise from compiler optimizations and the loss of semantic cues in compiled code, which LLMs struggle to recover without contextual guidance. To address this challenge, we propose ICL4Decomp, a hybrid decompilation framework that leverages in-context learning (ICL) to guide LLMs toward generating re-executable source code. Notably, our approach is model-agnostic and requires no fine-tuning, enabling plug-and-play use with off-the-shelf LLMs. We evaluate ICL4Decomp across multiple datasets, optimization levels, and compilers, demonstrating around 40{\%} improvement in re-executability over state-of-the-art decompilation methods while maintaining robustness."
}<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="wang-etal-2026-icl4decomp">
<titleInfo>
<title>ICL4Decomp: Towards Re-executable Reverse Engineering</title>
</titleInfo>
<name type="personal">
<namePart type="given">Xiaohan</namePart>
<namePart type="family">Wang</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Yuxin</namePart>
<namePart type="family">Hu</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Kevin</namePart>
<namePart type="family">Leach</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2026-10</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Findings of the Association for Computational Linguistics: EMNLP 2026</title>
</titleInfo>
<name type="personal">
<namePart type="given">Hung-Yi</namePart>
<namePart type="family">Lee</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Sunipa</namePart>
<namePart type="family">Dev</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Jessy</namePart>
<namePart type="family">Li</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Desmond</namePart>
<namePart type="family">Elliott</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Budapest, Hungary</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
<identifier type="isbn">979-8-89176-462-0</identifier>
</relatedItem>
<abstract>Binary decompilation, which aims to recover source code from compiled binaries, can be viewed as a low-resource and high-constraint form of neural machine translation. However, existing decompilation techniques often fail to produce source code that can be successfully recompiled and re-executed, particularly for optimized binaries. Recent advances in large language models (LLMs) have enabled neural approaches to decompilation, but the generated code is typically only semantically plausible rather than truly executable, limiting their practical reliability. These shortcomings arise from compiler optimizations and the loss of semantic cues in compiled code, which LLMs struggle to recover without contextual guidance. To address this challenge, we propose ICL4Decomp, a hybrid decompilation framework that leverages in-context learning (ICL) to guide LLMs toward generating re-executable source code. Notably, our approach is model-agnostic and requires no fine-tuning, enabling plug-and-play use with off-the-shelf LLMs. We evaluate ICL4Decomp across multiple datasets, optimization levels, and compilers, demonstrating around 40% improvement in re-executability over state-of-the-art decompilation methods while maintaining robustness.</abstract>
<identifier type="citekey">wang-etal-2026-icl4decomp</identifier>
<location>
<url>https://aclanthology.org/2026.findings-emnlp.1542/</url>
</location>
<part>
<date>2026-10</date>
<extent unit="page">
<start>32819</start>
<end>32832</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T ICL4Decomp: Towards Re-executable Reverse Engineering
%A Wang, Xiaohan
%A Hu, Yuxin
%A Leach, Kevin
%Y Lee, Hung-Yi
%Y Dev, Sunipa
%Y Li, Jessy
%Y Elliott, Desmond
%S Findings of the Association for Computational Linguistics: EMNLP 2026
%D 2026
%8 October
%I Association for Computational Linguistics
%C Budapest, Hungary
%@ 979-8-89176-462-0
%F wang-etal-2026-icl4decomp
%X Binary decompilation, which aims to recover source code from compiled binaries, can be viewed as a low-resource and high-constraint form of neural machine translation. However, existing decompilation techniques often fail to produce source code that can be successfully recompiled and re-executed, particularly for optimized binaries. Recent advances in large language models (LLMs) have enabled neural approaches to decompilation, but the generated code is typically only semantically plausible rather than truly executable, limiting their practical reliability. These shortcomings arise from compiler optimizations and the loss of semantic cues in compiled code, which LLMs struggle to recover without contextual guidance. To address this challenge, we propose ICL4Decomp, a hybrid decompilation framework that leverages in-context learning (ICL) to guide LLMs toward generating re-executable source code. Notably, our approach is model-agnostic and requires no fine-tuning, enabling plug-and-play use with off-the-shelf LLMs. We evaluate ICL4Decomp across multiple datasets, optimization levels, and compilers, demonstrating around 40% improvement in re-executability over state-of-the-art decompilation methods while maintaining robustness.
%U https://aclanthology.org/2026.findings-emnlp.1542/
%P 32819-32832
Markdown (Informal)
[ICL4Decomp: Towards Re-executable Reverse Engineering](https://aclanthology.org/2026.findings-emnlp.1542/) (Wang et al., Findings 2026)
ACL