کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
461712 | 696626 | 2008 | 13 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A backtracking search tool for constructing combinatorial test suites A backtracking search tool for constructing combinatorial test suites](/preview/png/461712.png)
Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool.
Journal: Journal of Systems and Software - Volume 81, Issue 10, October 2008, Pages 1681–1693