Name
Abstract | ||
|---|---|---|
Combinatorial Test Design, CTD, does not easily lend itself to the modeling of ordered parameter-values. Such modeling is much needed in practice, e.g. For the testing of sequences of API calls or parameterized events. We extend the CTD paradigm to address this need. We define a test as an ordered tuple of the parameter-values of the model, and introduce the concepts of ordered restrictions and ordered interaction coverage requirements. We develop an efficient algorithm for generating a small set of tests that satisfy the ordered and unordered interaction coverage requirements and evaluate it on several real-life examples. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICSTW.2014.13 | ICST Workshops |
Keywords | Field | DocType |
combinatorial testing, ctd, order requirements, ordered tests,availability,sequential analysis,computational modeling,testing,concrete | Data mining,Parameterized complexity,Tuple,CTD,Theoretical computer science,Combinatorial testing,Combinatorial design,Engineering,Program testing,Small set | Conference |
ISSN | Citations | PageRank |
2159-4848 | 4 | 0.44 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eitan Farchi | 1 | 590 | 46.38 |
| Itai Segall | 2 | 185 | 13.22 |
| Rachel Tzoref-Brill | 3 | 149 | 12.01 |
| Aviad Zlotnick | 4 | 70 | 6.87 |