Algorithmic methods for covering arrays of higher index

Ryan E. Dougherty, Kristoffer Kleine, Michael Wagner, Charles J. Colbourn, Dimitris E. Simos

Research output: Contribution to journalArticlepeer-review

Abstract

Covering arrays are combinatorial objects used in testing large-scale systems to increase confidence in their correctness. To do so, each interaction of at most a specified number t of factors is represented in at least one test; that is, the covering array has strength t and index 1. For certain systems, the outcome of running a test may be altered by variability of the interaction effect or by measurement error of the test result. To improve the efficacy of testing, one can ensure that each interaction of t or fewer factors is represented in at least λ tests. When λ> 1 , this leads to covering arrays of higher index. We explore two algorithmic methods for constructing covering arrays of higher index. One is based on the in-parameter-order algorithm, and the other employs a conditional expectation paradigm. We compare these two by performing experiments on real-world benchmarks and on uniform parameter sets.

Original languageEnglish (US)
Article number28
JournalJournal of Combinatorial Optimization
Volume45
Issue number1
DOIs
StatePublished - Jan 2023

Keywords

  • Conditional expectation
  • Covering array
  • In-parameter-order algorithm
  • Software testing

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Algorithmic methods for covering arrays of higher index'. Together they form a unique fingerprint.

Cite this