Name
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 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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICST.2015.7102599 | The IEEE International Conference on Software Testing, Verification and Validation |
Field | DocType | ISSN |
Test Management Approach,Computer science,System testing,Theoretical computer science,Software performance testing,Software,Model-based testing,Test case,Combinatorial testing,Encoding (memory) | Conference | 2159-4848 |
Citations | PageRank | References |
7 | 0.44 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihisa Yamada 0002 | 1 | 34 | 7.11 |
| Takashi Kitamura | 2 | 51 | 6.97 |
| Cyrille Artho | 3 | 588 | 44.46 |
| Eun-Hye Choi | 4 | 39 | 4.00 |
| Yutaka Oiwa | 5 | 41 | 5.75 |
| Armin Biere | 6 | 4106 | 245.11 |