Abstract A key issue in testing is how many tests are needed for a required level of coverage or fault detection. Estimates are often based on error rates in initial testing, or on code coverage. For example, tests may be run until a desired level of statement or branch coverage is achieved. Combinatorial methods present an opportunity for a different approach to estimating required test set size, using characteristics of the test set. This paper describes methods for estimating the coverage of, and ability to detect, t-way interaction faults of a test set based on a covering array. We also develop a connection between (static) combinatorial coverage and (dynamic) code coverage, such that if a specific condition is satisfied, 100 % branch coverage is assured. Using these results, we propose practical recommendations for using combinatorial coverage in specifying test requirements, and for improving estimates of the fault detection capacity of a test set.
Another study REF presents useful combinatorial coverage methods used for estimating the coverage and quality of a test set in terms of fault detection for t-way interactions.
Measuring and specifying combinatorial coverage of test input configurations
Innovations in Systems and Software Engineering
Innovations in Systems and Software Engineering
Medicine Computer Science