Improved Strength Four Covering Arrays with Three Symbols

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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A covering array t-CA(n, k, g), of size n, strength t, degree k, and order g, is a k× n array on g symbols such that every t× n sub-array contains every t× 1 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 A is the number of distinct t-tuples contained in the column vectors of A 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)223-239
Number of pages17
JournalGraphs and Combinatorics
Volume34
Issue number1
DOIs
StatePublished - Jan 1 2018

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Improved Strength Four Covering Arrays with Three Symbols'. Together they form a unique fingerprint.

Cite this