Alan Hartman, Yoav Medan
Discrete Applied Mathematics
Paper
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.
Related
Alan Hartman, Dean G. Hoffman
European Journal of Combinatorics
Alan Hartman, Andrei Kirshin, et al.
SEAPP 2002
Conference paper
A UML simulator based on a generic model execution engine
Andrei Kirshin, Dany Moshkovich, et al.
ECMS 2006