paperbot · PL 论文追踪

全部论文 待读 收藏

P2 A scalable t-wise coverage estimator

一种可扩展的 t-wise 覆盖估计器
ICSE Proceedings of the 44th International Conference on Software Engineering2022匹配度 1/10 · 该论文研究组合测试中的 t-wise 覆盖估计与约束求解,属于软件测试方向,与用户关注的静态分析、LLM/Agent、浮点程序分析、贝叶斯程序分析均无直接交集。引用 6 inbox
Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, Vinodchandran N. Variyam
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出可扩展的 t-wise 覆盖估计方法,用于约束下高 t 值组合测试覆盖评估。

现代软件系统高度可配置,组合测试成为测试此类系统的重要范式;约束常用于刻画被测系统可工作的环境。生成测试套件的重要目标是达到更高的 t-wise 覆盖率,因此需要可扩展技术,既能估计给定测试集的 t-wise 覆盖率,也能在给定约束下估计最大可达的 t-wise 覆盖率。现有估计技术面临显著的可扩展性瓶颈。本文提出一种可扩展的 t-wise 覆盖率估计器,面向上述两类估计任务,旨在突破规模限制。摘要未具体报告实验设置与数值结果。

问题
在高度可配置系统与约束条件下,如何为组合测试设计可扩展的方法,以估计给定测试集的 t-wise 覆盖率或约束下最大可达的 t-wise 覆盖率。
方法
提出一种可扩展的 t-wise 覆盖率估计器,支持对给定测试集以及给定约束下的最大可达覆盖率进行估计;摘要未展开具体算法细节。
评估
以可扩展性为核心评估目标,针对现有估计技术面临的规模瓶颈进行评估;摘要未给出具体实验设置与结果。
原文摘要(Abstract)

Owing to the pervasiveness of software in our modern lives, software systems have evolved to be highly configurable. Combinatorial testing has emerged as a dominant paradigm for testing highly configurable systems. Often constraints are employed to define the environments where a given system under test (SUT) is expected to work. Therefore, there has been a sustained interest in designing constraint-based test suite generation techniques. A significant goal of test suite generation techniques is to achieve t-wise coverage for higher values of t. Therefore, designing scalable techniques that can estimate t-wise coverage for a given set of tests and/or the estimation of maximum achievable t-wise coverage under a given set of constraints is of crucial importance. The existing estimation techniques face significant scalability hurdles.

链接与引用

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

BibTeX
@inproceedings{Baranov0LMV22,
  title = {A scalable t-wise coverage estimator},
  author = {Eduard Baranov and Sourav Chakraborty and Axel Legay and Kuldeep S. Meel and Vinodchandran N. Variyam},
  booktitle = {ICSE},
  year = {2022},
  doi = {10.1145/3510003.3510218}
}