Disassembly as Weighted Interval Scheduling with Learned Weights
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910926534344704 |
|---|---|
| author | Flores-Montoya, Antonio Lim, Junghee Seitz, Adam Sood, Akshay Raff, Edward Holt, James |
| author_facet | Flores-Montoya, Antonio Lim, Junghee Seitz, Adam Sood, Akshay Raff, Edward Holt, James |
| contents | Disassembly is the first step of a variety of binary analysis and transformation techniques, such as reverse engineering, or binary rewriting. Recent disassembly approaches consist of three phases: an exploration phase, that overapproximates the binary's code; an analysis phase, that assigns weights to candidate instructions or basic blocks; and a conflict resolution phase, that downselects the final set of instructions. We present a disassembly algorithm that generalizes this pattern for a wide range of architectures, namely x86, x64, arm32, and aarch64. Our algorithm presents a novel conflict resolution method that reduces disassembly to weighted interval scheduling. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_01536 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Disassembly as Weighted Interval Scheduling with Learned Weights Flores-Montoya, Antonio Lim, Junghee Seitz, Adam Sood, Akshay Raff, Edward Holt, James Programming Languages Cryptography and Security Disassembly is the first step of a variety of binary analysis and transformation techniques, such as reverse engineering, or binary rewriting. Recent disassembly approaches consist of three phases: an exploration phase, that overapproximates the binary's code; an analysis phase, that assigns weights to candidate instructions or basic blocks; and a conflict resolution phase, that downselects the final set of instructions. We present a disassembly algorithm that generalizes this pattern for a wide range of architectures, namely x86, x64, arm32, and aarch64. Our algorithm presents a novel conflict resolution method that reduces disassembly to weighted interval scheduling. |
| title | Disassembly as Weighted Interval Scheduling with Learned Weights |
| topic | Programming Languages Cryptography and Security |
| url | https://arxiv.org/abs/2505.01536 |