A Scalable t-wise Coverage Estimator
Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper3
- Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and SamplingMate Soos, Stephan Gocht, Kuldeep S. MeelCAV 2020 · 被引用 102 次
- Baital: an adaptive weighted sampling approach for improved t-wise coverageEduard Baranov, Axel Legay, Kuldeep S. MeelFSE 2020 · 被引用 40 次
- Sparse Hashing for Scalable Approximate Model Counting: Theory and PracticeKuldeep S. Meel, S. AkshayLICS 2020 · 被引用 20 次
相关 Paper
- Beyond Pairwise Testing: Advancing 3-wise Combinatorial Interaction Testing for Highly Configurable SystemsChuan Luo, Shuangyu Lyu, Qiyuan Zhao, Wei Wu 等ISSTA 2024 · 被引用 6 次
- AutoCCAG: An Automated Approach to Constrained Covering Array GenerationChuan Luo, Jinkun Lin, Shaowei Cai, Xin Chen 等ICSE 2021 · 被引用 16 次
- SamplingCA: effective and efficient sampling-based pairwise testing for highly configurable software systemsChuan Luo, Qiyuan Zhao, Shaowei Cai, Hongyu Zhang 等FSE 2022 · 被引用 14 次
- LS-sampling: an effective local search based sampling approach for achieving high t-wise coverageChuan Luo, Binqi Sun, Bo Qiao, Junjie Chen 等FSE 2021 · 被引用 24 次
- A Tuple-Oriented Sampling Method for Generating Small Pairwise Covering Arrays in Configurable Software SystemsKaichen Chen, Yi Xiang, Haining Wang, Jiatong Ma 等FSE 2026
