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

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Automatic Generation of Combinatorial Test Data

Part of the SpringerBriefs in Computer Science Book Series

DOI: 10.1007/978-3-662-43429-1

ISBN: 978-3-662-43428-4

Publisher: Springer Berlin Heidelberg - Springer Journals

Sep 16, 2014

Available

Introduction to Combinatorial Testing

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 1 –16

[This chapter gives an introduction to combinatorial testing, in particular, an overview of its applications. Some basic concepts, including Latin squares, orthogonal arrays, and covering arrays, are described in detail, with examples. Variants of covering arrays, such as covering arrays with...
Available

Mathematical Construction Methods

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 17 –25

[This chapter presents some representative mathematical methods that are commonly used in the construction of orthogonal arrays and covering arrays, as well as some bounds on the size of such arrays.]
Available

One Test at a Time

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 27 –39

[This chapter presents the one-test-at-a-time algorithms for finding covering arrays. These algorithms generate the test suite in a greedy manner: test cases are generated one by one, until the coverage requirement is met, while each newly-generated test case covers as many uncovered target...
Available

The IPO Family

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 41 –49

[Aside from the one-test-at-a-time strategy, the in-parameter-order (IPO) is another greedy strategy for generating covering arrays. As the name says, the IPO strategy extends the covering array in parameter order. In each iteration, the algorithm extends a smaller covering array into a larger...
Available

Evolutionary Computation and Metaheuristics

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 51 –60

[This chapter describes how to use metaheuristic search and evolutionary algorithms to generate covering arrays for combinatorial testing. They include, among others, genetic algorithms, simulated annealing, tabu search, and particle swarm optimization.]
Available

Backtracking Search

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 61 –78

[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...
Available

Tools and Benchmarks

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 79 –83

[This chapter lists some test generation tools (mostly, tools for finding covering arrays). The chapter also gives some pointers to benchmarks, so that the reader can evaluate and select tools.]
Available

Other Related Topics

Zhang, Jian; Zhang, Zhiqiang; Ma, Feifei

Pages: 85 –90

[This chapter briefly discusses some other topics that are related to test data generation. They include, among others, how to construct a combinatorial testing model for the software under test, how to select a subset of test cases from an existing test suite, and how to generate special-purpose...

results per page

Prev
1
Next

Browse All eBooks