超集反编译
Superset Decompilation
AI总结:
本文提出超集反编译框架,通过模块化流程逐步解析二进制,提升反编译工具的灵活性和精度,实验证明其在多个指标上优于现有工具。
摘要:
反工程工具相较于现代编译器架构仍显庞大且命令式:分析受限于单一可变表示,难以扩展或改进,且迫使在正确性和精度之间做出提前选择。我们观察到反编译是编译的逆过程,可结构化为一系列模块化步骤,每个步骤对二进制进行逐级抽象的解释。我们将其形式化为证源引导的超集反编译(PGSD),一个框架通过单调推导二进制事实到关系存储。不同于提前确定单一解释,流程保留模糊解释作为并行候选者,延迟到最终选择阶段解决。Manifold将PGSD实现为一种声明式反工程框架,通过细粒度中间表示将Linux ELF二进制提升到C99,使用约35000行Rust和Datalog代码。在GNU coreutils上,Manifold的输出质量在多个指标上与Ghidra、IDA Pro、angr和RetDec相当,同时产生更少的编译器错误,并能跨编译器和优化级别泛化。
英文摘要:
Decompilation is the task of recovering high-level source from a compiled binary. Conventionally, it is implemented as a series of analyses and rewrites over a single representation, committing at each step to a single interpretation and discarding the rest. We argue this premature commitment is why decompilers struggle to produce compilable output on whole real-world programs, which is necessary for further testing. Compilation is many-to-one: a single binary may admit many source programs, and the evidence that resolves an ambiguity often lies far from where it arises. We therefore preserve competing interpretations when their resolution depends on non-local evidence, while resolving purely local ambiguities in a final solving stage. We formalize this approach as Superset Decompilation: monotone Datalog rules accumulate candidate interpretations across an IR hierarchy, and a per-function weighted MaxSMT solver jointly selects a globally type-consistent C program. Our implementation lifts stripped x86-64 Linux ELF binaries to C99 through CompCert IRs in 50K lines of Rust and Datalog. On GNU coreutils, it achieves 93\% recompilability and passes 7\% of the test suite.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。