%0 Journal Article %1 Yan2008 %A Yan, Jun %A Zhang, Jian %B Selected papers from the 30th Annual International Computer Software and Applications Conference (COMPSAC), Chicago, September 7-21, 2006 %D 2008 %J Journal of Systems and Software %K combinatorial coverage metaheuristic software testdata testing %N 10 %P 1681--1693 %T A backtracking search tool for constructing combinatorial test suites %U http://www.sciencedirect.com/science/article/B6V0N-4S01WFC-1/2/2cca71ad8e782f37a39d37eaece3ee46 %V 81 %X 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.

@article{Yan2008, abstract = {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.}, added-at = {2008-08-14T10:26:31.000+0200}, author = {Yan, Jun and Zhang, Jian}, biburl = {https://www.bibsonomy.org/bibtex/2bebc82123b5a267f0bf89c448d6b249c/ist_spl}, booktitle = {Selected papers from the 30th Annual International Computer Software and Applications Conference (COMPSAC), Chicago, September 7-21, 2006}, description = {ScienceDirect - Journal of Systems and Software : A backtracking search tool for constructing combinatorial test suites Combinatorial Covering Optimal Orthogonal Software array set test testing}, interhash = {c933a371bde99185315b3a9509dc1fa0}, intrahash = {bebc82123b5a267f0bf89c448d6b249c}, journal = {Journal of Systems and Software}, keywords = {combinatorial coverage metaheuristic software testdata testing}, month = {#oct#}, number = 10, pages = {1681--1693}, timestamp = {2008-08-14T10:26:31.000+0200}, title = {A backtracking search tool for constructing combinatorial test suites}, url = {http://www.sciencedirect.com/science/article/B6V0N-4S01WFC-1/2/2cca71ad8e782f37a39d37eaece3ee46}, volume = 81, year = 2008 }