Products of mixed covering arrays of strength two

Charles J. Colbourn; Sosina S. Martirosyan; Gary L. Mullen; Dennis Shasha; George B. Sherwood; Joseph L. Yucas

doi:10.1002/jcd.20065

Products of mixed covering arrays of strength two

Charles J. Colbourn, Sosina S. Martirosyan, Gary L. Mullen, Dennis Shasha, George B. Sherwood, Joseph L. Yucas

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

A covering array CA(N;t, k, v) is an N × k array such that every N × t subarray contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple "cut-and-paste" construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived.

Original language	English (US)
Pages (from-to)	124-138
Number of pages	15
Journal	Journal of Combinatorial Designs
Volume	14
Issue number	2
DOIs	https://doi.org/10.1002/jcd.20065
State	Published - Mar 2006

Keywords

Covering array
Latin square
Orthogonal array

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1002/jcd.20065

Cite this

@article{b5fe237ceec74b40857354531c959044,

title = "Products of mixed covering arrays of strength two",

abstract = "A covering array CA(N;t, k, v) is an N × k array such that every N × t subarray contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple {"}cut-and-paste{"} construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived.",

keywords = "Covering array, Latin square, Orthogonal array",

author = "Colbourn, {Charles J.} and Martirosyan, {Sosina S.} and Mullen, {Gary L.} and Dennis Shasha and Sherwood, {George B.} and Yucas, {Joseph L.}",

year = "2006",

month = mar,

doi = "10.1002/jcd.20065",

language = "English (US)",

volume = "14",

pages = "124--138",

journal = "Journal of Combinatorial Designs",

issn = "1063-8539",

publisher = "John Wiley & Sons Inc.",

number = "2",

}

TY - JOUR

T1 - Products of mixed covering arrays of strength two

AU - Colbourn, Charles J.

AU - Martirosyan, Sosina S.

AU - Mullen, Gary L.

AU - Shasha, Dennis

AU - Sherwood, George B.

AU - Yucas, Joseph L.

PY - 2006/3

Y1 - 2006/3

N2 - A covering array CA(N;t, k, v) is an N × k array such that every N × t subarray contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple "cut-and-paste" construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived.

AB - A covering array CA(N;t, k, v) is an N × k array such that every N × t subarray contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple "cut-and-paste" construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived.

KW - Covering array

KW - Latin square

KW - Orthogonal array

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

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

U2 - 10.1002/jcd.20065

DO - 10.1002/jcd.20065

M3 - Article

AN - SCOPUS:33645150168

SN - 1063-8539

VL - 14

SP - 124

EP - 138

JO - Journal of Combinatorial Designs

JF - Journal of Combinatorial Designs

IS - 2

ER -

Products of mixed covering arrays of strength two

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this