Abstract | ||
---|---|---|
[InlineEquation not available: see fulltext.]-wise testing is a widely used technique for combinatorial interaction testing. Prioritizing testing reorders test cases by relevance, testing important aspects more thoroughly. We propose a novel technique for [InlineEquation not available: see fulltext.]-wise test case generation to satisfy the three distinct prioritization criteria of interaction coverage, weight coverage, and KL divergence. The proposed technique generates small [InlineEquation not available: see fulltext.]-wise test cases, where high-priority test cases appear early and frequently. Our early evaluation confirms that the proposed technique improves on existing techniques based on the three prioritization criteria. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-662-44857-1_14 | ICTSS |
Keywords | Field | DocType |
Combinatorial testing,N-wise testing,prioritized testing | Combinatorial interaction testing,Data mining,Computer science,Prioritization,Test case,Combinatorial testing,Kullback–Leibler divergence | Conference |
Volume | ISSN | Citations |
8763 | 0302-9743 | 2 |
PageRank | References | Authors |
0.42 | 5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Eun-Hye Choi | 1 | 39 | 4.00 |
Takashi Kitamura | 2 | 51 | 6.97 |
Cyrille Artho | 3 | 588 | 44.46 |
Yutaka Oiwa | 4 | 41 | 5.75 |