Name
Abstract | ||
|---|---|---|
In this paper, we develop a combinatorial testing technique for tree-structured test models. First, we generalize our previous test models for combinatorial testing based on and-xor trees with constraints limited to a syntactic subset of propositional logic, to allow for constraints in full propositional logic. We prove that the generalized test models are strictly more expressive than the limited ones. Then we develop an algorithm for combinatorial testing for the generalized models, and show its correctness and computational complexity. We apply a tool based on our algorithm to an actual ticket gate system that is used by several large transportation companies in Japan. Experimental results show that our technique outperforms existing techniques. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/QRS.2015.29 | QRS |
Keywords | Field | DocType |
software testing,combinatorial testing | Orthogonal array testing,Computer science,Correctness,Ticket,Propositional calculus,Theoretical computer science,Model-based testing,Combinatorial testing,Syntax,Computational complexity theory | Conference |
Citations | PageRank | References |
4 | 0.45 | 18 |
Authors | ||
8 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Kitamura | 1 | 8 | 1.55 |
| Akihisa Yamada | 2 | 4 | 0.45 |
| Goro Hatayama | 3 | 8 | 1.30 |
| Cyrille Artho | 4 | 588 | 44.46 |
| Eun-Hye Choi | 5 | 4 | 0.45 |
| Thi Bich Ngoc Do | 6 | 4 | 0.45 |
| Yutaka Oiwa | 7 | 41 | 5.75 |
| Shinya Sakuragi | 8 | 4 | 0.45 |