Factorials Experiments, Covering Arrays, and Combinatorial Testing
| Autor: | Dimitris E. Simos, D. Richard Kuhn, Yu Lei, Raghu N. Kacker |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
business.industry
Computer science Applied Mathematics media_common.quotation_subject 010102 general mathematics Automotive industry 0102 computer and information sciences 01 natural sciences Computational Mathematics Software Computational Theory and Mathematics 010201 computation theory & mathematics Software testing Combinatorial testing Quality (business) 0101 mathematics Aerospace business Software engineering Internet of Things Medical systems media_common |
| Zdroj: | Mathematics in Computer Science. 15:715-739 |
| ISSN: | 1661-8289 1661-8270 |
| DOI: | 10.1007/s11786-021-00502-7 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink