Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have applications in the realm of software testing. In this paper we raise several new problems motivated by these applications and discuss algorithms for their solution.
|Number of pages||8|
|State||Published - 6 Jul 2004|
- Covering array
- Orthogonal array
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics