paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Incremental CFG patching for binary rewriting

面向二进制重写的增量式 CFG 补丁
ASPLOS Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems2021匹配度 3/10 · 该论文属于程序分析与二进制重写领域,涉及CFG和抽象解释,与用户对静态分析的一般兴趣有边缘关联;但未涉及LLM/Agent、浮点程序分析或贝叶斯程序分析,也不是将静态分析应用于ML/Agentic程序,因此与核心研究方向匹配度低。引用 8 inbox
Xiaozhu Meng, Weijie Liu
crossref: 2026-09-12

AI 速览

一句话:提出增量式 CFG 补丁方法,力图兼顾二进制重写的高可靠性与低运行时开销。

二进制重写广泛用于软件安全、正确性评估、性能分析与调试。现有方法主要分两类:将二进制提升到 IR 再重新生成的方法运行时开销接近零,但依赖限制性假设才能完成完整二进制分析与 IR 提升;逐指令打补丁的方法不依赖二进制分析、可靠性高,却带来难以承受的运行时开销。本文提出增量 CFG 补丁(incremental CFG patching)用于二进制重写,试图通过增量的控制流图补丁结合两类方法,在不要求完整二进制分析及其限制性假设的同时控制运行时开销。摘要未给出具体实现与评估结果。

问题
二进制重写需要在可靠性与运行时开销之间权衡:IR 提升方法依赖限制性假设,逐指令补丁方法开销过高。
方法
提出增量式 CFG 补丁(incremental CFG patching)进行二进制重写,具体算法与实现细节未在摘要中展开。
评估
摘要未提供评估方式、实验设置或结果。
原文摘要(Abstract)

Binary rewriting has been widely used in software security, software correctness assessment, performance analysis, and debugging. One approach for binary rewriting lifts the binary to IR and then regenerates a new one, which achieves near-to-zero runtime overhead, but relies on several limiting assumptions on binaries to achieve complete binary analysis to perform IR lifting. Another approach patches individual instructions without utilizing any binary analysis, which has great reliability as it does not make assumptions about the binary, but incurs prohibitive runtime overhead.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot6148,
  title = {Incremental CFG patching for binary rewriting},
  author = {Xiaozhu Meng and Weijie Liu},
  booktitle = {ASPLOS},
  year = {2021},
  doi = {10.1145/3445814.3446765}
}