Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Automatic Generation of Combinatorial Test DataBacktracking Search

Automatic Generation of Combinatorial Test Data: Backtracking Search [This chapter describes how to use backtracking search to find covering arrays and orthogonal arrays. The basic algorithms are presented, as well as various heuristics which improve the efficiency of the search. Different from the approaches described in the previous chapters, backtracking search is able to find the smallest test suite.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Automatic Generation of Combinatorial Test DataBacktracking Search

Download PDF
17 pages

Loading next page...
 
/lp/springer-journals/automatic-generation-of-combinatorial-test-data-backtracking-search-BMgNcKLA70
Publisher
Springer Berlin Heidelberg
Copyright
© The Author(s) 2014
ISBN
978-3-662-43428-4
Pages
61 –78
DOI
10.1007/978-3-662-43429-1_6
Publisher site
See Chapter on Publisher Site

Abstract

[This chapter describes how to use backtracking search to find covering arrays and orthogonal arrays. The basic algorithms are presented, as well as various heuristics which improve the efficiency of the search. Different from the approaches described in the previous chapters, backtracking search is able to find the smallest test suite.]

Published: Sep 16, 2014

Keywords: Backtracking Search; Covering Arrays (CA); Orthogonal Array; Unassigned Cells; CA Generation

There are no references for this article.