kirancodes.me
To Proof Maintenance & Beyond!

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 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.

BibTeX
@inproceedings{Baranov-al:ICSE22,
  author    = {Eduard Baranov and
               Sourav Chakraborty and
               Axel Legay and
               Kuldeep S. Meel and
               N. Variyam Vinodchandran},
  title     = {A Scalable t-wise Coverage Estimator},
  booktitle = {ICSE},
  pages     = {36--47},
  publisher = {{ACM}},
  year      = {2022},
}

Related papers