A Scalable t-wise Coverage Estimator
Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran
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 ๐ก-wise coverage for higher values of ๐ก. Therefore, designing scalable techniques that can estimate ๐ก-wise coverage for a given set of tests and/or the estimation of maximum achievable ๐ก-wise coverage under a given set of constraints is of crucial importance. The existing estimation techniques face significant scalability hurdles. The primary scientific contribution of this work is the design of scalable algorithms with mathematical guarantees to estimate (i) ๐ก-wise coverage for a given set of tests, and (ii) maximum ๐ก-wise coverage for a given set of constraints. In particular, we design a scalable framework ApproxCov that takes in a test set U, a coverage parameter ๐ก, a tolerance parameter ๐, and a confidence parameter ๐ฟ, and returns an estimate of the ๐ก-wise coverage of U that is guaranteed to be within (1 ยฑ ๐)-factor of the ground truth with probability at least 1 -๐ฟ. We design a scalable framework ApproxMaxCov that, for a given formula F, a coverage parameter ๐ก, a tolerance parameter ๐, and a confidence parameter ๐ฟ, outputs an approximation which is guaranteed to be within (1 ยฑ ๐) factor of the maximum achievable ๐กwise coverage under F, with probability โฅ 1-๐ฟ. Our comprehensive evaluation demonstrates that ApproxCov and ApproxMaxCov can handle benchmarks that are beyond the reach of current state-ofthe-art approaches. We believe that the availability of ApproxCov and ApproxMaxCov will enable test suite designers to evaluate the effectiveness of their generators and thereby significantly impact the development of combinatorial testing techniques.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0578f274-fe65-4cfc-944f-daecf909033dCited by top-tier papers1
Ask how each one uses itBuilds on3
- Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and SamplingMate Soos, Stephan Gocht, Kuldeep S. MeelCAV 2020 ยท 102 citations
- Baital: an adaptive weighted sampling approach for improved t-wise coverageEduard Baranov, Axel Legay, Kuldeep S. MeelFSE 2020 ยท 40 citations
- Sparse Hashing for Scalable Approximate Model Counting: Theory and PracticeKuldeep S. Meel, S. AkshayLICS 2020 ยท 20 citations
Related papers
- Beyond Pairwise Testing: Advancing 3-wise Combinatorial Interaction Testing for Highly Configurable SystemsChuan Luo, Shuangyu Lyu, Qiyuan Zhao, Wei Wu et al.ISSTA 2024 ยท 6 citations
- AutoCCAG: An Automated Approach to Constrained Covering Array GenerationChuan Luo, Jinkun Lin, Shaowei Cai, Xin Chen et al.ICSE 2021 ยท 16 citations
- SamplingCA: effective and efficient sampling-based pairwise testing for highly configurable software systemsChuan Luo, Qiyuan Zhao, Shaowei Cai, Hongyu Zhang et al.FSE 2022 ยท 14 citations
- LS-sampling: an effective local search based sampling approach for achieving high t-wise coverageChuan Luo, Binqi Sun, Bo Qiao, Junjie Chen et al.FSE 2021 ยท 24 citations
- A Tuple-Oriented Sampling Method for Generating Small Pairwise Covering Arrays in Configurable Software SystemsKaichen Chen, Yi Xiang, Haining Wang, Jiatong Ma et al.FSE 2026
