Problems and algorithms for covering arrays

被引：162
作者：
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
相关论文
共 50 条
  • [31] Perfect sequence covering arrays
    Yuster, Raphael
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (03) : 585 - 593
  • [32] COVERING PERFECT HASH FAMILIES AND COVERING ARRAYS OF HIGHER INDEX
    Colbourn, Charles j.
    INTERNATIONAL JOURNAL OF GROUP THEORY, 2024, 13 (03) : 293 - 305
  • [33] Covering Arrays Generation Methods Survey
    Kuliamin, Victor
    Petukhov, Alexander
    LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION, AND VALIDATION, PT II, 2010, 6416 : 382 - 396
  • [34] Heterogeneous Hash Families and Covering Arrays
    Colbourn, Charles J.
    Torres-Jimenez, Jose
    ERROR-CORRECTING CODES, FINITE GEOMETRIES AND CRYPTOGRAPHY, 2010, 523 : 3 - +
  • [35] UPPER BOUNDS ON THE SIZE OF COVERING ARRAYS
    Sarkar, Kaushik
    Colbourn, Charles J.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (02) : 1277 - 1293
  • [36] Augmentation of Covering Arrays of Strength Two
    Charles J. Colbourn
    Graphs and Combinatorics, 2015, 31 : 2137 - 2147
  • [37] Asymptotic and constructive methods for covering perfect hash families and covering arrays
    Charles J. Colbourn
    Erin Lanus
    Kaushik Sarkar
    Designs, Codes and Cryptography, 2018, 86 : 907 - 937
  • [38] Asymptotic and constructive methods for covering perfect hash families and covering arrays
    Colbourn, Charles J.
    Lanus, Erin
    Sarkar, Kaushik
    DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (04) : 907 - 937
  • [39] Augmentation of Covering Arrays of Strength Two
    Colbourn, Charles J.
    GRAPHS AND COMBINATORICS, 2015, 31 (06) : 2137 - 2147
  • [40] Covering arrays of strength 3 and 4 from holey difference matrices
    Li, Yang
    Ji, Lijun
    Yin, Jianxing
    DESIGNS CODES AND CRYPTOGRAPHY, 2009, 50 (03) : 339 - 350
12345