Solving the t-Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling

doi:10.1145/3688836

Solving the t-Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling

2024-12-31

0

OA

AI

DOI：10.1145/3688836

Original request for help

Save

Abstract

En 中文

To meet the increasing demand for customized software, highly configurable systems become essential in practice. Such systems offer many options to configure, and ensuring the reliability of these systems is critical. A widely used evaluation metric for testing these systems is t-wise coverage, where t represents testing strength, and its value typically ranges from 2 to 6. It is crucial to design effective and efficient methods for generating test suites that achieve high t-wise coverage. However, current state-of-the-art methods need to generate large test suites for achieving high t-wise coverage. In this work, we propose a novel method called LS-Sampling-Plus that can efficiently generate test suites with high t-wise coverage for 2 <= t <= 6 while being smaller in size compared to existing state-of-the-art methods. LS-Sampling-Plus incorporates many core algorithmic techniques, including two novel scoring functions, a dynamic mechanism for updating sampling probabilities, and a validity-guaranteed systematic search method. Our experiments on various practical benchmarks show that LS-Sampling-Plus can achieve higher t-wise coverage than current state-of-the-art methods, through building a test suite of the same size. Moreover, our evaluations indicate the effectiveness of all core algorithmic techniques of LS-Sampling-Plus. Furthermore, LS-Sampling-Plus exhibits better scalability and fault detection capability than existing state-of-the-art methods.

Keywords:

CONFIGURATION CHECKING

ALGORITHM

GENERATION

SAT

Solving the t-Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling

Abstract

Journal

Organization