A density-based greedy algorithm for higher strength covering arrays

Renée C. Bryce, Charles Colbourn

Research output: Contribution to journalArticle

102 Citations (Scopus)

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

Keywords

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

ASJC Scopus subject areas

  • Software
  • Media Technology

Cite this

A density-based greedy algorithm for higher strength covering arrays. / Bryce, Renée C.; Colbourn, Charles.

In: Software Testing Verification and Reliability, Vol. 19, No. 1, 2009, p. 37-53.

Research output: Contribution to journalArticle

@article{f741f261408141bca05827fd6765f2f1,
title = "A density-based greedy algorithm for higher strength covering arrays",
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.",
keywords = "Covering arrays, Greedy algorithm, Mixed-level covering arrays, Software interaction testing, T-way interaction coverage",
author = "Bryce, {Ren{\'e}e C.} and Charles Colbourn",
year = "2009",
doi = "10.1002/stvr.393",
language = "English (US)",
volume = "19",
pages = "37--53",
journal = "Software Testing Verification and Reliability",
issn = "0960-0833",
publisher = "John Wiley and Sons Ltd",
number = "1",

}

TY - JOUR

T1 - A density-based greedy algorithm for higher strength covering arrays

AU - Bryce, Renée C.

AU - Colbourn, Charles

PY - 2009

Y1 - 2009

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

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

KW - Covering arrays

KW - Greedy algorithm

KW - Mixed-level covering arrays

KW - Software interaction testing

KW - T-way interaction coverage

UR - http://www.scopus.com/inward/record.url?scp=69249171417&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69249171417&partnerID=8YFLogxK

U2 - 10.1002/stvr.393

DO - 10.1002/stvr.393

M3 - Article

AN - SCOPUS:69249171417

VL - 19

SP - 37

EP - 53

JO - Software Testing Verification and Reliability

JF - Software Testing Verification and Reliability

SN - 0960-0833

IS - 1

ER -