Optimization of Combinatorial Testing by Incremental SAT Solving
Sprache des Titels:
Englisch
Original Buchtitel:
Proc. 8th IEEE Intl. Conf. on Software Testing Verification, and Validation (ICST'15)
Original Kurzfassung:
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 searchspace
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
Forschungs-