跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19577 · v1

ElevatorII: High-Performance Fully-Static Cross-ISA Binary Translation

首次提交 2026-11-15 03:12
版本更新 2026-11-15 03:12
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

The established method for running software compiled for one instruction-set architecture (ISA) on a different ISA is by emulation in conjunction with just-in-time (JIT) compilation. This requires run-time support on the target that needs to be trusted and whose compilation decisions are hard to predict or reconstruct. We present ElevatorII, a fully static, ahead-of-time cross-ISA binary-to-binary compiler from x86 to AArch64 that challenges the established consensus. Our approach eliminates the need for run-time support on the target, removes the hard to reproduce effects of dynamic compilation, and provides the capability to exhaustively test the actual binary that is eventually executed. Our approach combines superset disassembly with observation-guided path selection. Superset disassembly overcomes the code vs. data differentiation problem by creating a separate control flow path for every possible interpretation of every byte in the input binary. It guarantees that there is pre-translated code for every possible jump destination in the original text segment, even for computed jumps that are not statically decidable. Static and observation-guided path selection then creates additional optimized "confirmed code paths" that overlay the regular grid. On the 11 SPEC CPU 2026 Integer benchmarks that do not use C++ exceptions, ElevatorII runs at 2.5x native AArch64 time, on par with Box64, the fastest dynamic translator, and 5x faster than QEMU. It also translates binaries obfuscated with virtualization and branch functions, which no static disassembler can follow. Our approach trades execution performance for space: our output code is 51x the size of code compiled from source. We alleviate this by separating cold code to a .text.unlikely ELF section: only 2-3% hot code winds up in the main ELF section, while the rest will likely never be loaded into memory.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 03:12 · 最新观测版本

ElevatorII: High-Performance Fully-Static Cross-ISA Binary Translation

The established method for running software compiled for one instruction-set architecture (ISA) on a different ISA is by emulation in conjunction with just-in-time (JIT) compilation. This requires run-time support on the target that needs to be trusted and whose compilation decisions are hard to predict or reconstruct. We present ElevatorII, a fully static, ahead-of-time cross-ISA binary-to-binary compiler from x86 to AArch64 that challenges the established consensus. Our approach eliminates the need for run-time support on the target, removes the hard to reproduce effects of dynamic compilation, and provides the capability to exhaustively test the actual binary that is eventually executed. Our approach combines superset disassembly with observation-guided path selection. Superset disassembly overcomes the code vs. data differentiation problem by creating a separate control flow path for every possible interpretation of every byte in the input binary. It guarantees that there is pre-translated code for every possible jump destination in the original text segment, even for computed jumps that are not statically decidable. Static and observation-guided path selection then creates additional optimized "confirmed code paths" that overlay the regular grid. On the 11 SPEC CPU 2026 Integer benchmarks that do not use C++ exceptions, ElevatorII runs at 2.5x native AArch64 time, on par with Box64, the fastest dynamic translator, and 5x faster than QEMU. It also translates binaries obfuscated with virtualization and branch functions, which no static disassembler can follow. Our approach trades execution performance for space: our output code is 51x the size of code compiled from source. We alleviate this by separating cold code to a .text.unlikely ELF section: only 2-3% hot code winds up in the main ELF section, while the rest will likely never be loaded into memory.

查看此版本解读 →查看此版本原文 ↗