Problems and algorithms for covering arrays

被引：164

作者：

Hartman, A ^{[1
]}

Raskin, L ^{[1
]}

机构：

[1] IBM Haifa Res Labs, IL-31905 Haifa, Israel

来源：

DISCRETE MATHEMATICS | 2004年 / 284卷 / 1-3期

关键词：

covering array; orthogonal array;

D O I：

10.1016/j.disc.2003.11.029

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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

引用

页码：149 / 156

页数：8

共 18 条

[1]

BORADAY SY, 1998, P C IND MATH TAG, P59

[2] ORTHOGONAL ARRAYS OF INDEX UNITY [J].