paperbot · PL 论文追踪

全部论文 待读 收藏

P2 FastKLEE: faster symbolic execution via reducing redundant bound checking of type-safe pointers

FastKLEE:通过减少类型安全指针的冗余边界检查加速符号执行
FSE Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering2022匹配度 2/10 · 该论文属于经典符号执行/程序分析优化,核心是类型推断减少边界检查,未涉及用户重点关注的两类 PL-AI 交叉(用静态分析分析 ML/Agent 程序、用 LLM/Agent 改进静态分析/形式化验证),也不涉及浮点程序分析或贝叶斯程序分析。引用 4 inbox
Haoxin Tu, Lingxiao Jiang, Xuhua Ding, He Jiang
crossref: 2026-09-12

AI 速览

一句话:通过类型推断区分安全/不安全指针,减少符号执行 IR 解释中的冗余边界检查,从而加速 KLEE。

符号执行广泛用于程序分析与软件测试,但 KLEE、Angr 等引擎在执行中解释中间表示(IR)时开销较大。现有加速研究较少优化内部解释操作。本文提出 FastKLEE,通过减少类型安全指针的冗余边界检查来加速 IR 代码解释。它先用类型推断系统将最常解释的读写指令涉及的指针分为安全与不安全两类,再定制内存操作,仅对不安全指针执行边界检查,省略安全指针的冗余检查。作者在 KLEE 上结合 CCured 实现 FastKLEE。评估表明,在探索相同 10k 条执行路径时,其耗时相较 KLEE 最多减少 9.1%,平均减少 5.6%。

问题
符号执行引擎解释 IR 时性能开销大,现有加速工作很少优化其内部解释操作,尤其是指针访问的边界检查。
方法
FastKLEE 先通过类型推断将读写指令涉及的指针分为安全与不安全,再定制内存操作,仅对不安全指针执行边界检查。
评估
在 KLEE 上结合 CCured 实现 FastKLEE,并与 KLEE 对比探索相同 10k 条执行路径的耗时,最多降低 9.1%、平均降低 5.6%。
原文摘要(Abstract)

Symbolic execution (SE) has been widely adopted for automatic program analysis and software testing. Many SE engines (e.g., KLEE or Angr) need to interpret certain Intermediate Representations (IR) of code during execution, which may be slow and costly. Although a plurality of studies proposed to accelerate SE, few of them consider optimizing the internal interpretation operations. In this paper, we propose FastKLEE, a faster SE engine that aims to speed up execution via reducing redundant bound checking of type-safe pointers during IR code interpretation. Specifically, in FastKLEE, a type inference system is first leveraged to classify pointer types (i.e., safe or unsafe) for the most frequently interpreted read/write instructions. Then, a customized memory operation is designed to perform bound checking for only the unsafe pointers and omit redundant checking on safe pointers. We implement FastKLEE on top of the well-known SE engine KLEE and combined it with the notable type inference system CCured. Evaluation results demonstrate that FastKLEE is able to reduce by up to 9.1% (5.6% on average) as the state-of-the-art approach KLEE in terms of the time to explore the same number (i.e., 10k) of execution paths. FastKLEE is opensourced at https://github.com/haoxintu/FastKLEE. A video demo of FastKLEE is available at https://youtu.be/fjV_a3kt-mo.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot7028,
  title = {FastKLEE: faster symbolic execution via reducing redundant bound checking of type-safe pointers},
  author = {Haoxin Tu and Lingxiao Jiang and Xuhua Ding and He Jiang},
  booktitle = {FSE},
  year = {2022},
  doi = {10.1145/3540250.3558919}
}