Метод попарного тестування з використанням ортогонального масиву

Abstract

Shorten a little this text Software testing and debugging is an essential part in software development process but this process is confirmed to be laberintensive and expensive. Combinatorial testing (also called interaction testing) is an efficient method of generating test inputs based on a specification. To date, most research work in combinatorial testing has focused on proposing new approaches that attempt to create test sets of minimal size that cover all pairwise, triple, or one-way combinations of factors. This paper considers pairwise testing (that is, a special case of combinatorial testing aimed at covering all pairwise combinations).