Name
Abstract | ||
|---|---|---|
Constraint handling is a challenging problem in combinatorial test generation. In general, there are two ways to handle constraints, i.e., constraint solving and forbidden tuples. In our earlier work, we proposed a constraint handling approach based on forbidden tuples for software product line systems consisting of only Boolean parameters. In this paper, we generalize this approach for general software systems that may consist of other types of parameter. The key idea of our approach is using the notion of minimum forbidden tuples to perform validity checks on both complete and partial tests. Furthermore, we propose an on-demand strategy that only generates minimum forbidden tuples for validity checks as they are encountered, instead of generating all of them up front. We implemented our generalized approach with and without the on-demand strategy in our combinatorial testing tool called ACTS. We performed experiments on 35 systems using ACTS and PICT. The results show that for these 35 systems, our generalized approach performed faster than PICT and the constraint solving-based approach in ACTS. For some large systems, the improvement on test generation time is up to two orders of magnitude. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICSTW.2015.7107441 | ICST Workshops |
Keywords | Field | DocType |
Combinatorial Testing, Constraints, Forbidden Tuples | Generation time,Tuple,Computer science,Algorithm,Software system,Software product line,Combinatorial testing,Order of magnitude | Conference |
ISSN | Citations | PageRank |
2159-4848 | 13 | 0.55 |
References | Authors | |
12 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Linbin Yu | 1 | 145 | 8.36 |
| Feng Duan | 2 | 34 | 4.43 |
| Yu Lei | 3 | 676 | 44.45 |
| Raghu N. Kacker | 4 | 19 | 1.75 |
| D. Richard Kuhn | 5 | 2723 | 203.24 |