Improved Strength Four Covering Arrays with Three Symbols

Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan, Charles Colbourn

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A covering array t-CA(n, k, g), of size n, strength t, degree k, and order g, is a (Formula presented.) array on g symbols such that every (Formula presented.) sub-array contains every (Formula presented.) column on g symbols at least once. Covering arrays have been studied for their applications to software testing, hardware testing, drug screening, and in areas where interactions of multiple parameters are to be tested. In this paper, we present an algebraic construction that improves many of the best known upper bounds on n for covering arrays 4-CA(n, k, 3). The t-coverage of a testing array (Formula presented.) is the number of distinct t-tuples contained in the column vectors of (Formula presented.) divided by the total number of t-tuples. If the testing array is a covering array of strength t, its t-coverage is 100%. The covering arrays with budget constraints problem is the problem of constructing a testing array of size at most n having largest possible coverage, given values of t, k, g and n. This paper also presents several testing arrays with high 4-coverage.

Original languageEnglish (US)
Pages (from-to)1-17
Number of pages17
JournalGraphs and Combinatorics
DOIs
StateAccepted/In press - Dec 15 2017

Fingerprint

Covering Array
Testing
Coverage
Software testing
Column vector
Budget Constraint
Software Testing
Computer hardware
Screening
Drugs
Hardware
Upper bound
Distinct
Interaction

Keywords

  • Coverage
  • Covering arrays
  • Projective general linear group
  • Software testing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Improved Strength Four Covering Arrays with Three Symbols. / Maity, Soumen; Akhtar, Yasmeen; Chandrasekharan, Reshma C.; Colbourn, Charles.

In: Graphs and Combinatorics, 15.12.2017, p. 1-17.

Research output: Contribution to journalArticle

Maity, Soumen ; Akhtar, Yasmeen ; Chandrasekharan, Reshma C. ; Colbourn, Charles. / Improved Strength Four Covering Arrays with Three Symbols. In: Graphs and Combinatorics. 2017 ; pp. 1-17.
@article{063ee4ad5d4c474e91a77d6f278bfc9c,
title = "Improved Strength Four Covering Arrays with Three Symbols",
abstract = "A covering array t-CA(n, k, g), of size n, strength t, degree k, and order g, is a (Formula presented.) array on g symbols such that every (Formula presented.) sub-array contains every (Formula presented.) column on g symbols at least once. Covering arrays have been studied for their applications to software testing, hardware testing, drug screening, and in areas where interactions of multiple parameters are to be tested. In this paper, we present an algebraic construction that improves many of the best known upper bounds on n for covering arrays 4-CA(n, k, 3). The t-coverage of a testing array (Formula presented.) is the number of distinct t-tuples contained in the column vectors of (Formula presented.) divided by the total number of t-tuples. If the testing array is a covering array of strength t, its t-coverage is 100{\%}. The covering arrays with budget constraints problem is the problem of constructing a testing array of size at most n having largest possible coverage, given values of t, k, g and n. This paper also presents several testing arrays with high 4-coverage.",
keywords = "Coverage, Covering arrays, Projective general linear group, Software testing",
author = "Soumen Maity and Yasmeen Akhtar and Chandrasekharan, {Reshma C.} and Charles Colbourn",
year = "2017",
month = "12",
day = "15",
doi = "10.1007/s00373-017-1861-9",
language = "English (US)",
pages = "1--17",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",

}

TY - JOUR

T1 - Improved Strength Four Covering Arrays with Three Symbols

AU - Maity, Soumen

AU - Akhtar, Yasmeen

AU - Chandrasekharan, Reshma C.

AU - Colbourn, Charles

PY - 2017/12/15

Y1 - 2017/12/15

N2 - A covering array t-CA(n, k, g), of size n, strength t, degree k, and order g, is a (Formula presented.) array on g symbols such that every (Formula presented.) sub-array contains every (Formula presented.) column on g symbols at least once. Covering arrays have been studied for their applications to software testing, hardware testing, drug screening, and in areas where interactions of multiple parameters are to be tested. In this paper, we present an algebraic construction that improves many of the best known upper bounds on n for covering arrays 4-CA(n, k, 3). The t-coverage of a testing array (Formula presented.) is the number of distinct t-tuples contained in the column vectors of (Formula presented.) divided by the total number of t-tuples. If the testing array is a covering array of strength t, its t-coverage is 100%. The covering arrays with budget constraints problem is the problem of constructing a testing array of size at most n having largest possible coverage, given values of t, k, g and n. This paper also presents several testing arrays with high 4-coverage.

AB - A covering array t-CA(n, k, g), of size n, strength t, degree k, and order g, is a (Formula presented.) array on g symbols such that every (Formula presented.) sub-array contains every (Formula presented.) column on g symbols at least once. Covering arrays have been studied for their applications to software testing, hardware testing, drug screening, and in areas where interactions of multiple parameters are to be tested. In this paper, we present an algebraic construction that improves many of the best known upper bounds on n for covering arrays 4-CA(n, k, 3). The t-coverage of a testing array (Formula presented.) is the number of distinct t-tuples contained in the column vectors of (Formula presented.) divided by the total number of t-tuples. If the testing array is a covering array of strength t, its t-coverage is 100%. The covering arrays with budget constraints problem is the problem of constructing a testing array of size at most n having largest possible coverage, given values of t, k, g and n. This paper also presents several testing arrays with high 4-coverage.

KW - Coverage

KW - Covering arrays

KW - Projective general linear group

KW - Software testing

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

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

U2 - 10.1007/s00373-017-1861-9

DO - 10.1007/s00373-017-1861-9

M3 - Article

SP - 1

EP - 17

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

ER -