covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. while numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. random generation techniques c...

A covering array CA(N ; t, k, v) is anN×k array on v symbols such that everyN×t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N ; t, k, v) exists is called the covering array number of t, k, and v, and it is denoted by CAN(t, k, v). In this work we prove that if exists CA(N ; t+ 1, k + 1, v) it can be obtained from the juxtaposition of v ...

Nowadays, software companies develop and maintain their software for several clients.Consequently, these applications have to be integrated in heterogenous context andadapt to the user requriements. All these products are sharing commonalities but alsodiffer in certain point due to business specific constraints. Configurable systems facili-tate the creation of these product fami...

Abstract In this note we answer positively an open question posed by Yuster in 2020 [14] on the polynomial boundedness of perfect sequence covering array number $$g(n,k)$$ g ( n , k ) (PSCA number). The...

This short paper introduces a method for verifying equivalence classes for module/unit testing. This is achieved using a two-layer covering array, in which some or all values of a primary covering array represent equivalence classes. A second layer covering array of the equivalence class values is computed, and its values substituted for the equivalence class names in the primary array. It is s...

A covering array CA(N ; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. Recursive constructions for covering arrays of strengths 3 and 4 are developed, generalizing many “Rouxtype” constructi...

For a prime power q ≡ 1 (mod v), the q × q cyclotomic matrix, whose entries are the discrete logarithmsmodulo v of the entries in the addition table of Fq , has been shown using character theoretic arguments to produce an ε-biased array, provided that q is large enough as a function of v and ε. A suitable choice of ε ensures that the array is a covering array of strength t when q > t2v4t . On t...

A covering array CA(N; t, k, v) is an N × k array such that every N × t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used in experiments to screen for interactions among t-subsets of k components. Strength two covering arrays have been studied from numerous viewpoints, resulting in a variety of computational, direct, and...