Titlebook: Automatic Generation of Combinatorial Test Data; Jian Zhang,Zhiqiang Zhang,Feifei Ma Book 2014 The Author(s) 2014 Combinatorial testing.Co

鸣叫大步走

书目名称Automatic Generation of Combinatorial Test Data影响因子(影响力)




书目名称Automatic Generation of Combinatorial Test Data影响因子(影响力)学科排名




书目名称Automatic Generation of Combinatorial Test Data网络公开度




书目名称Automatic Generation of Combinatorial Test Data网络公开度学科排名




书目名称Automatic Generation of Combinatorial Test Data被引频次




书目名称Automatic Generation of Combinatorial Test Data被引频次学科排名




书目名称Automatic Generation of Combinatorial Test Data年度引用




书目名称Automatic Generation of Combinatorial Test Data年度引用学科排名




书目名称Automatic Generation of Combinatorial Test Data读者反馈




书目名称Automatic Generation of Combinatorial Test Data读者反馈学科排名

prolate

WAIL

https://doi.org/10.1007/978-1-4757-2502-5This 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.

善于骗人

暂时别动

https://doi.org/10.1007/978-1-4757-5331-8This 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.

profligate

Nonconvex Optimization and Its ApplicationsThis 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 test cases in the process of debugging.

火海

Introduction to Combinatorial Testing,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 constraints, are also described.

Entrancing

Mathematical Construction Methods,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.

murmur

candle

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.