Factorials Experiments, Covering Arrays, and Combinatorial Testing

被引:2
|
作者
Kacker, Raghu N. [1 ]
Kuhn, D. Richard [1 ]
Lei, Yu [2 ]
Simos, Dimitris E. [3 ]
机构
[1] NIST, Gaithersburg, MD 20899 USA
[2] Univ Texas Arlington, Arlington, TX 76019 USA
[3] SBA Res, A-1040 Vienna, Austria
关键词
Design of experiments; Orthogonal arrays; Pairwise-testing; Software testing; Verification and validation of software; AUTOMATED TEST ORACLES; TEST-GENERATION; DESIGN; TOOL; COVERAGE; STRATEGY; SYSTEM;
D O I
10.1007/s11786-021-00502-7
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the twenty-first century, our life will increasingly depend on software-based products and complex interconnected systems. Thus, the quality and security of software-based systems is a world-wide concern. Combinatorial testing is a versatile methodology for finding errors (bugs) and vulnerabilities in software-based systems. This paper offers a review of combinatorial testing. Combinatorial testing (CT) methods evolved from investigations which looked like factorial experiments (FE) with pass/fail outcomes. We will discuss the similarities and differences between FE and CT. Use of CT for detecting errors (bugs) in software-based systems has gained significant interest from the international software testing community. Many successful results have been reported from the use of CT to detect software errors in aerospace, automotive, defense, cybersecurity, electronic medical systems, and financial service industries. Now, combinatorial testing methods are being increasingly used to investigate vulnerabilities in software-based systems. Combinatorial testing could be useful in detecting errors and security vulnerabilities in Internet of Things, Autonomous Systems, and Artificially Intelligent Software.
引用
收藏
页码:715 / 739
页数:25
相关论文
共 50 条
  • [41] Robustness Testing of Real-Time Automotive Systems Using Sequence Covering Arrays
    Becci, Graciela
    Dhadyalla, Gunwant
    Mouzakitis, Alexandros
    Marco, James
    Moore, Andrew David
    SAE INTERNATIONAL JOURNAL OF PASSENGER CARS-ELECTRONIC AND ELECTRICAL SYSTEMS, 2013, 6 (01): : 287 - 293
  • [42] New bounds for mixed covering arrays in t-way testing with uniform strength
    Gonzalez-Hernandez, Loreto
    INFORMATION AND SOFTWARE TECHNOLOGY, 2015, 59 : 17 - 32
  • [43] Binary covering arrays on tournaments
    Maltais, Elizabeth
    Moura, Lucia
    Newman, Mike
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
  • [44] Constructions of difference covering arrays
    Yin, HX
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2003, 104 (02) : 327 - 339
  • [45] Variable strength covering arrays
    Raaphorst, Sebastian
    Moura, Lucia
    Stevens, Brett
    JOURNAL OF COMBINATORIAL DESIGNS, 2018, 26 (09) : 417 - 438
  • [46] Binary consecutive covering arrays
    Godbole, A. P.
    Koutras, M. V.
    Milienos, F. S.
    ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2011, 63 (03) : 559 - 584
  • [47] A Survey of Binary Covering Arrays
    Lawrence, Jim
    Kacker, Raghu N.
    Lei, Yu
    Kuhn, D. Richard
    Forbes, Michael
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [48] Covering Arrays on Product Graphs
    Akhtar, Yasmeen
    Maity, Soumen
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 635 - 652
  • [49] Covering arrays and hash families
    Colbourn, Charles J.
    INFORMATION SECURITY, CODING THEORY AND RELATED COMBINATORICS: INFORMATION CODING AND COMBINATORICS, 2011, 29 : 99 - 135
  • [50] On Covering Radius of Orthogonal Arrays
    Boumova, Silvia
    Ramaj, Tedis
    Stoyanova, Maya
    PROCEEDINGS OF THE 2020 SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ALGEBRAIC AND COMBINATORIAL CODING THEORY (ACCT 2020): PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ACCT 2020, 2020, : 23 - 28