DMCA
A density-based greedy algorithm for higher strength covering arrays (2008)
| Citations: | 13 - 4 self |
BibTeX
@MISC{Bryce08adensity-based,
author = {Renée C. Bryce and Charles J. Colbourn},
title = {A density-based greedy algorithm for higher strength covering arrays },
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Algorithmic construction of software interaction test suites has focussed on pairwise coverage; less is known about the efficient construction of test suites for t-way interactions with t ≥ 3. This work extends an efficient density-based algorithm for pairwise coverage to generate t-way interaction test suites, and show that it guarantees a logarithmic upper bound on the size of the test suites as a function of the number of factors. To complement this theoretical guarantee, an implementation is outlined and some practical improvements are made. Computational comparisons with other published methods are reported. Many of the results improve upon those in the literature. However, limitations on the ability of one-test-at-a-time algorithms are also identified.
Keyphrases
density-based greedy algorithm pairwise coverage algorithmic construction efficient density-based algorithm one-test-at-a-time algorithm test suite computational comparison t-way interaction practical improvement logarithmic upper bound software interaction test t-way interaction test suite theoretical guarantee efficient construction
