paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Ankou

Ankou
ICSE Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering2020匹配度 2/10 · 该论文属于灰盒模糊测试与动态缺陷发现,改进的是测试用例搜索的适应度函数,而非用户关注的静态分析、LLM/Agent 辅助程序分析、浮点程序分析或贝叶斯程序分析。虽然同属程序分析与软件工程领域,但与研究方向核心几乎没有直接交集。引用 52 inbox
Valentin J. M. Manès, Soomin Kim, Sang Kil Cha
crossref: 2026-09-12

AI 速览

一句话:提出首个能区分执行信息组合的灰盒模糊测试器 Ankou,显著提升缺陷发现效率。

现有灰盒模糊测试的适应度函数仅考虑覆盖数据的并集,而非其组合,因而无法区分覆盖相同的不同执行,导致搜索常陷入局部最优。本文提出 Ankou,首个能够识别执行信息不同组合的灰盒模糊测试器,并讨论了设计与实现中遇到的可扩展性挑战。实验结果表明,Ankou 在发现缺陷方面分别比 AFL 和 Angora 有效 1.94 倍和 8.0 倍。

问题
现有灰盒模糊测试的适应度函数只考虑覆盖数据的并集而非组合,无法区分覆盖相同的不同执行,导致搜索陷入局部最优。
方法
提出 Ankou,首个识别执行信息不同组合的灰盒模糊测试器,并解决其设计与实现中的可扩展性挑战。
评估
通过实验将 Ankou 与 AFL、Angora 对比,发现缺陷的有效性分别提升 1.94 倍和 8.0 倍。
原文摘要(Abstract)

Grey-box fuzzing is an evolutionary process, which maintains and evolves a population of test cases with the help of a fitness function. Fitness functions used by current grey-box fuzzers are not informative in that they cannot distinguish different program executions as long as those executions achieve the same coverage. The problem is that current fitness functions only consider a union of data, but not their combination. As such, fuzzers often get stuck in a local optimum during their search. In this paper, we introduce Ankou, the first grey-box fuzzer that recognizes different combinations of execution information, and present several scalability challenges encountered while designing and implementing Ankou. Our experimental results show that Ankou is 1.94× and 8.0× more effective in finding bugs than AFL and Angora, respectively.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot5592,
  title = {Ankou},
  author = {Valentin J. M. Manès and Soomin Kim and Sang Kil Cha},
  booktitle = {ICSE},
  year = {2020},
  doi = {10.1145/3377811.3380421}
}