paperbot · PL 论文追踪

全部论文 待读 收藏

P2 MuRS: Mutant Ranking and Suppression using Identifier Templates

MuRS:使用标识符模板的变异体排序与抑制
FSE Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering2023匹配度 2/10 · 该论文关注变异测试中的变异体排序与抑制,属于测试/调试和开发者工具方向,不涉及用户核心研究方向(LLM/Agent 与静态分析/形式化验证、浮点程序分析、贝叶斯程序分析)的交叉。虽然具有工业落地和问题驱动特征,但主题匹配度低。引用 1 inbox
Zimin Chen, Małgorzata Salawa, Manushree Vijayvergiya, Goran Petrović, Marko Ivanković, René Just
crossref: 2026-09-12dblp: 2026-09-12arxiv: 2026-09-12

AI 速览

一句话:MuRS 利用标识符模板对变异体分组,并基于历史开发者反馈自动排序与抑制无用变异体。

该论文关注基于 diff 的变异测试在代码审查中的应用。此类变异测试只变异变更行,能独立于代码库规模扩展,并产生与开发者当前任务直接相关的测试目标。Google 的变异测试服务已将其集成到代码审查流程,并持续收集开发者对变异体的反馈。现有服务依赖人工编写的抑制规则来过滤持续收到负面反馈的无用变异体,但维护这些规则成本高。本文提出并评估 MuRS:它按被测源码中的模式对变异体分组,并利用同一组内历史开发者反馈来排序和抑制未来变异体。评估采用 A/B 测试,将 MuRS 与现有变异测试服务比较。结果显示,尽管基线已使用人工抑制规则,MuRS 仍将负面反馈率从 12.41% 显著降至 11.45%,并能恢复基线中的既有抑制规则;同时发现语句删除变异体组同时获得最多正面和负面反馈,表明这些组仍需额外上下文来区分有用与无用变异体。总体而言,MuRS 能从开发者反馈中自动学习更细粒度的抑制规则。

问题
基于 diff 的变异测试服务依赖人工编写抑制规则来过滤无用变异体,工程成本高,且难以覆盖细粒度模式。
方法
MuRS 根据源码中的标识符模板等模式将变异体分组,并利用同组历史开发者反馈对变异体排序和抑制。
评估
通过 A/B 测试将 MuRS 与已有使用人工抑制规则的变异测试服务比较,分析负面反馈率及规则恢复情况。
原文摘要(Abstract)

Diff-based mutation testing is a mutation testing approach that only mutates lines affected by a code change under review. This approach scales independently of the code-base size and introduces test goals (mutants) that are directly relevant to an engineer’s goal such as fixing a bug, adding a new feature, or refactoring existing functionality. Google’s mutation testing service integrates diff-based mutation testing into the code review process and continuously gathers developer feedback on mutants surfaced during code review. To enhance the developer experience, the mutation testing service uses a number of manually-written rules that suppress not-useful mutants—mutants that have consistently received negative developer feedback. However, while effective, manually implementing suppression rules requires significant engineering time. This paper proposes and evaluates MuRS, an automated approach that groups mutants by patterns in the source code under test and uses these patterns to rank and suppress future mutants based on historical developer feedback on mutants in the same group. To evaluate MuRS, we conducted an A/B testing study, comparing MuRS to the existing mutation testing service. Despite the strong baseline, which uses manually-written suppression rules, the results show a statistically significantly lower negative feedback ratio of 11.45% for MuRS versus 12.41% for the baseline. The results also show that MuRS is able to recover existing suppression rules implemented in the baseline. Finally, the results show that statement-deletion mutant groups received both the most positive and negative developer feedback, suggesting a need for additional context that can distinguish between useful and not-useful mutants in these groups. Overall, MuRS is able to recover existing suppression rules and automatically learn additional, finer-grained suppression rules from developer feedback.

链接与引用

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

BibTeX
@inproceedings{ChenSVPIJ23,
  title = {MuRS: Mutant Ranking and Suppression using Identifier Templates},
  author = {Zimin Chen and Małgorzata Salawa and Manushree Vijayvergiya and Goran Petrović and Marko Ivanković and René Just},
  booktitle = {FSE},
  year = {2023},
  doi = {10.1145/3611643.3613901}
}