Abstract
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
| Original language | English |
|---|---|
| Title of host publication | Proc. 8th IEEE Intl. Conf. on Software Testing Verification, and Validation (ICST'15) |
| Pages | 1-10 |
| Number of pages | 10 |
| Publication status | Published - 2015 |
Fields of science
- 102 Computer Sciences
- 603109 Logic
- 202006 Computer hardware
JKU Focus areas
- Computation in Informatics and Mathematics