Optimization of Combinatorial Testing by Incremental SAT Solving
Akihisa Yamada, Takashi Kitamura, Cyrille Valentin Artho, Eun-Hye Choi, Yutaka Oiwa, Armin Biere · 2015
Combinatorial testing aims at reducing the cost of software and system testing by reducing the number of test cases to be executed. We propose an approach for combinatorial testing that generates a set of test cases that is as small as possible, using incremental SAT solving. We present several search-space pruning techniques that further improve our approach. Experiments show a significant improvement of our approach over other SAT-based approaches, and considerable reduction of the number of test cases over other combinatorial testing tools.