The explicit construction of covering arrays arises in many disparate applications in which
factors or components interact. Despite this, current computational tools are effective only …

We define and study variable strength covering arrays (also called covering arrays on
hypergraphs), which are generalizations of covering arrays and covering arrays on graphs …

Covering arrays (CAs) can be used to detect the existence of faulty pairwise interactions
between parameters or components in a software system. The generalization considered …

Combinatorial testing aims to detect interaction faults, which are triggered by interaction
among parameters in system, by covering some specific combinations of parametric values …

We present a new construction for covering arrays inspired by ideas from Munemasa (Finite
Fields Appl 4: 252–260, 1998) using linear feedback shift registers (LFSRs). For a primitive …

The effective construction of covering arrays for interaction testing relies on fast, practical
algorithms. Such algorithms are needed to directly construct covering arrays and variants …

In the test suite generation (TSG) problem for software systems, I is a set of n input
parameters where each I∈ I has κ (I) data values, and O is a collection of subsets of I where …

Covering array (CA) on a hypergraph H is a combinatorial object used in interaction testing
of a complex system modeled as H. Given at-uniform hypergraph H and positive integer s, it …

Covering arrays are combinatorial objects that have been successfully applied in the design
of test suits for testing software, networks and circuits. Mixed covering arrays on graphs are …

Consider a maximum-length shift-register sequence generated by a primitive polynomial f
over a finite field. The set of its subintervals is a linear code whose dual code is formed by all …