paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Evolving Ranking-Based Failure Proximities for Better Clustering in Fault Isolation

演化基于排序的失败邻近度以改进故障隔离中的聚类
ASE Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering2022匹配度 2/10 · 该论文聚焦多故障场景下的失败聚类与故障隔离,属于软件测试与调试方向,未涉及用户核心关注的 LLM/Agent 与静态分析、形式化验证、浮点程序分析或贝叶斯程序分析的交叉。虽然属于程序分析相关领域,但研究问题和方法与用户画像匹配度很低。引用 5 inbox
Yi Song, Xiaoyuan Xie, Xihao Zhang, Quanming Liu, Ruizhi Gao
crossref: 2026-09-12

AI 速览

一句话:提出基于遗传编程的框架演化风险评价公式,以在故障隔离中更准确地对多故障场景下的失败进行聚类。

在多故障场景中,与特定故障无关的失败会降低故障定位效果。通常将失败测试用例聚类,使同一故障导致的失败分到一组。其中基于排序的失败邻近度(R-proximity)需通过指纹函数(即风险评价公式,REF)将每个失败用例表示为语句可疑度排序列表。现有 REF 均为单故障定位设计,无法满足多故障场景需求。本文提出基于遗传编程的框架及精细适应度函数,演化出更适合多故障场景的 REF。通过小规模程序训练,得到可推广到更大规模场景的 REF 集合。最佳 REF 在故障数量估计和聚类效果上分别超越当前最优方法 50.72% 和 47.41%。框架高度可配置,演化公式无需重训练即可直接用于未来失败表示任务。

问题
多故障场景下,现有风险评价公式(REF)均为单故障定位设计,导致失败聚类效果不佳,影响故障隔离。
方法
提出基于遗传编程的框架及精细适应度函数,自动演化适用于多故障场景的 REF,并在小规模程序集上训练后推广。
评估
在程序集上训练后,将演化的 REF 应用于更一般场景,与当前最优方法比较故障数量估计和聚类效果,最佳结果分别提升 50.72% 和 47.41%。
原文摘要(Abstract)

Failures that are not related to a specific fault can reduce the effectiveness of fault localization in multi-fault scenarios. To tackle this challenge, researchers and practitioners typically cluster failures (e.g., failed test cases) into several disjoint groups, with those caused by the same fault grouped together. In such a fault isolation process that requires input in a mathematical form, ranking-based failure proximity (R-proximity) is widely used to model failed test cases. In R-proximity, each failed test case is represented as a suspiciousness ranking list of program statements through a fingerprinting function (i.e., a risk evaluation formula, REF). Although many off-the-shelf REFs have been integrated into R-proximity, they were designed for single-fault localization originally. To the best of our knowledge, no REF has been developed to serve as a fingerprinting function of R-proximity in multi-fault scenarios. For better clustering failures in fault isolation, in this paper, we present a genetic programming-based framework along with a sophisticated fitness function, for evolving REFs with the goal of more properly representing failures in multi-fault scenarios. By using a small set of programs for training, we get a collection of REFs that can obtain good results applicable in a larger and more general scale of scenarios. The best one of them outperforms the state-of-the-art by 50.72% and 47.41% in faults number estimation and clustering effectiveness, respectively. Our framework is highly configurable for further use, and the evolved formulas can be directly applied in future failure representation tasks without any retraining.

链接与引用

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

BibTeX
@inproceedings{paperbot7255,
  title = {Evolving Ranking-Based Failure Proximities for Better Clustering in Fault Isolation},
  author = {Yi Song and Xiaoyuan Xie and Xihao Zhang and Quanming Liu and Ruizhi Gao},
  booktitle = {ASE},
  year = {2022},
  doi = {10.1145/3551349.3556922}
}