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 条
  • [1] Correction to: Factorials Experiments, Covering Arrays, and Combinatorial Testing
    Raghu N. Kacker
    D. Richard Kuhn
    Yu Lei
    Dimitris E. Simos
    Mathematics in Computer Science, 2021, 15 : 741 - 741
  • [2] Computing Sequence Covering Arrays using Unified Combinatorial Interaction Testing
    Mercan, Hanefi
    Yilmaz, Cemal
    2021 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW 2021), 2021, : 77 - 80
  • [3] Meta -Heuristic Algorithm for Constructing Higher-Index Covering Arrays for Combinatorial Interaction Testing
    Qin, Gang
    Zheng, Junjun
    Tsuchiya, Tatsuhiro
    2023 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS, ICSTW, 2023, : 190 - 196
  • [4] Mixed optimization combinatorial method for constructing covering arrays
    A. A. Petukhov
    Programming and Computer Software, 2014, 40 : 10 - 20
  • [5] Mixed optimization combinatorial method for constructing covering arrays
    Petukhov, A. A.
    PROGRAMMING AND COMPUTER SOFTWARE, 2014, 40 (01) : 10 - 20
  • [6] Software and hardware testing using combinatorial covering suites
    Hartman, A
    GRAPH THEORY, COMBINATORICS AND ALGORITHMS: INTERDISCIPLINARY APPLICATIONS, 2005, : 237 - 266
  • [7] Covering Arrays of Strength Four and Software Testing
    Akhtar, Yasmeen
    Maity, Soumen
    Chandrasekharan, Reshma C.
    MATHEMATICS AND COMPUTING, 2015, 139 : 391 - 398
  • [8] Constrained locating arrays for combinatorial interaction testing
    Jin, Hao
    Tsuchiya, Tatsuhiro
    JOURNAL OF SYSTEMS AND SOFTWARE, 2020, 170
  • [9] Covering the Combinatorial Design Space of Multiplex CRISPR/Cas Experiments in Plants
    Van Huffel, Kirsten
    Stock, Michiel
    Ruttink, Tom
    De Baets, Bernard
    FRONTIERS IN PLANT SCIENCE, 2022, 13
  • [10] Combinatorial testing for software: An adaptation of design of experiments
    Kacker, Raghu N.
    Kuhn, D. Richard
    Lei, Yu
    Lawrence, James F.
    MEASUREMENT, 2013, 46 (09) : 3745 - 3752