10 Citations (Scopus)

Abstract

Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN(t; k; v), in a covering array for given values of the parameters t; k, and v. Asymptotic upper bounds for CAN(t; k; v) have been established using the Stein-Lovász-Johnson strategy and the Lovász local lemma. A series of improvements on these bounds is developed in this paper. First an estimate for the discrete Stein-Lovász-Johnson bound is derived. Then using alteration, the Stein-Lovász-Johnson bound is improved upon, leading to a two-stage construction algorithm. Bounds from the Lovász local lemma are improved upon in a different manner, by examining group actions on the set of symbols. Two asymptotic upper bounds on CAN(t; k; v) are established that are tighter than the known bounds. A two-stage bound is derived that employs the Lovász local lemma and the conditional Lovász local lemma distribution.

Original languageEnglish (US)
Pages (from-to)1277-1293
Number of pages17
JournalSIAM Journal on Discrete Mathematics
Volume31
Issue number2
DOIs
StatePublished - 2017

Fingerprint

Covering Array
Upper bound
Lemma
Group Action
Hardware
Testing
Software
Series

Keywords

  • Conditional expectation algorithm
  • Covering array
  • Lovász local lemma

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Upper bounds on the size of covering arrays. / Sarkar, Kaushik; Colbourn, Charles.

In: SIAM Journal on Discrete Mathematics, Vol. 31, No. 2, 2017, p. 1277-1293.

Research output: Contribution to journalArticle

@article{67e80ac295a244b9850e9025c7206f0b,
title = "Upper bounds on the size of covering arrays",
abstract = "Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN(t; k; v), in a covering array for given values of the parameters t; k, and v. Asymptotic upper bounds for CAN(t; k; v) have been established using the Stein-Lov{\'a}sz-Johnson strategy and the Lov{\'a}sz local lemma. A series of improvements on these bounds is developed in this paper. First an estimate for the discrete Stein-Lov{\'a}sz-Johnson bound is derived. Then using alteration, the Stein-Lov{\'a}sz-Johnson bound is improved upon, leading to a two-stage construction algorithm. Bounds from the Lov{\'a}sz local lemma are improved upon in a different manner, by examining group actions on the set of symbols. Two asymptotic upper bounds on CAN(t; k; v) are established that are tighter than the known bounds. A two-stage bound is derived that employs the Lov{\'a}sz local lemma and the conditional Lov{\'a}sz local lemma distribution.",
keywords = "Conditional expectation algorithm, Covering array, Lov{\'a}sz local lemma",
author = "Kaushik Sarkar and Charles Colbourn",
year = "2017",
doi = "10.1137/16M1067767",
language = "English (US)",
volume = "31",
pages = "1277--1293",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - Upper bounds on the size of covering arrays

AU - Sarkar, Kaushik

AU - Colbourn, Charles

PY - 2017

Y1 - 2017

N2 - Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN(t; k; v), in a covering array for given values of the parameters t; k, and v. Asymptotic upper bounds for CAN(t; k; v) have been established using the Stein-Lovász-Johnson strategy and the Lovász local lemma. A series of improvements on these bounds is developed in this paper. First an estimate for the discrete Stein-Lovász-Johnson bound is derived. Then using alteration, the Stein-Lovász-Johnson bound is improved upon, leading to a two-stage construction algorithm. Bounds from the Lovász local lemma are improved upon in a different manner, by examining group actions on the set of symbols. Two asymptotic upper bounds on CAN(t; k; v) are established that are tighter than the known bounds. A two-stage bound is derived that employs the Lovász local lemma and the conditional Lovász local lemma distribution.

AB - Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN(t; k; v), in a covering array for given values of the parameters t; k, and v. Asymptotic upper bounds for CAN(t; k; v) have been established using the Stein-Lovász-Johnson strategy and the Lovász local lemma. A series of improvements on these bounds is developed in this paper. First an estimate for the discrete Stein-Lovász-Johnson bound is derived. Then using alteration, the Stein-Lovász-Johnson bound is improved upon, leading to a two-stage construction algorithm. Bounds from the Lovász local lemma are improved upon in a different manner, by examining group actions on the set of symbols. Two asymptotic upper bounds on CAN(t; k; v) are established that are tighter than the known bounds. A two-stage bound is derived that employs the Lovász local lemma and the conditional Lovász local lemma distribution.

KW - Conditional expectation algorithm

KW - Covering array

KW - Lovász local lemma

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

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

U2 - 10.1137/16M1067767

DO - 10.1137/16M1067767

M3 - Article

VL - 31

SP - 1277

EP - 1293

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -