A density-based greedy algorithm for higher strength covering arrays

Renée C. Bryce, Charles Colbourn

Research output: Contribution to journalArticle

103 Scopus citations

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 study extends an efficient density-based algorithm for pairwise coverage to generate t-way interaction test suites and shows 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.

Original languageEnglish (US)
Pages (from-to)37-53
Number of pages17
JournalSoftware Testing Verification and Reliability
Volume19
Issue number1
DOIs
StatePublished - Sep 1 2009

Keywords

  • Covering arrays
  • Greedy algorithm
  • Mixed-level covering arrays
  • Software interaction testing
  • T-way interaction coverage

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Cite this