Problems and algorithms for covering arrays

Abstract

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. © 2004 Elsevier B.V. All rights reserved.