Affordable Access

Publisher Website

A backtracking search tool for constructing combinatorial test suites

Authors
Journal
Journal of Systems and Software
0164-1212
Publisher
Elsevier
Publication Date
Volume
81
Issue
10
Identifiers
DOI: 10.1016/j.jss.2008.02.034
Keywords
  • Software Testing
  • Combinatorial Testing
  • Optimal Test Set
  • Covering Array
  • Orthogonal Array
Disciplines
  • Computer Science
  • Mathematics

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.