Metraipolis › archive › dc_cf81d627aba1
No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation — arXiv:2609.16423
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.16423
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T19:33:06.399Z
- SHA-256 of the archived text
be60fff6833e710656dc112348e441c924da691fa75be9a55369919cc3949959- Stable URL of this page
https://metraipolis.com/documento/dc_cf81d627aba1
How to cite
No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation — arXiv:2609.16423 — arXiv (en), https://arxiv.org/abs/2609.16423 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cf81d627aba1 (Metraipolis archive dc_cf81d627aba1, sha256 be60fff6833e710656dc112348e441c924da691fa75be9a55369919cc3949959)
BibTeX
@misc{dccf81d627aba1,
title = {No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation — arXiv:2609.16423},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.16423},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cf81d627aba1; sha256 be60fff6833e710656dc112348e441c924da691fa75be9a55369919cc3949959},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16423. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Binary recompilation is a technique for operating directly on executable code. It promises to automate two important tasks: retrofitting security mitigations onto legacy binaries, and migrating binaries across instruction set architectures (ISAs). Yet today, there is no fully automated system that can reliably lift arbitrary binary executables to a compiler intermediate representation (IR) such as LLVM IR, or that can fully statically and reliably translate non-trivial binary executables from one ISA to another. The main underlying problem is that recovering a program's control flow graph (CFG) statically is impossible in general: computed branches can jump to targets that cannot be determined without actually running the program. Existing systems resort to runtime fallback mechanisms, requiring a significant portion of the binary translation machinery to accompany the translated program on the target machine. This article presents a fully static, whole-program binary lifting system requiring no runtime translation support on the target. Rather than attempting to distinguish code from data, we treat every byte offset as a potential branch target and lift the entire binary in a brute-force manner, constructing a superset CFG that conservatively contains all feasible control flows. Statically unresolvable computed branches are thereby reduced to lookups in a dispatch table that points to the corresponding translated control flow path. We have implemented this approach as a prototype binary recompiler from x86-64 binaries to LLVM IR, requiring no code/data heuristics. We validate it with a fully static cross-compilation to AArch64, achieved by reusing existing LLVM backends with no modification. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-16 in cs.CR). Categorie arXiv: Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2609.16423 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T18:42:42.610Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).