Institutional Repository
| a backtracking search tool for constructing combinatorial test suites | |
| Jun Yan; Zhang Jian | |
| 2008 | |
| Source | Journal of Systems and Software
 |
| Volume | 81Issue:10Pages:1681-1693 |
| English Abstract | Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of Combinatorial Test suites). A new optimal covering array is found by this tool. |
| Indexed Type | ei |
| Keyword | Software Testing Combinatorial Testing Optimal Test Set Covering Array Orthogonal Array |
| Department | 计算机科学国家重点实验室 |
| Language | 英语 |
| WOS ID | WOS:000259427100005 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/3136 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Jun Yan,Zhang Jian. a backtracking search tool for constructing combinatorial test suites[J]. Journal of Systems and Software,2008,81(10):1681-1693. |
| APA | Jun Yan,&Zhang Jian.(2008).a backtracking search tool for constructing combinatorial test suites.Journal of Systems and Software,81(10),1681-1693. |
| MLA | Jun Yan,et al."a backtracking search tool for constructing combinatorial test suites".Journal of Systems and Software 81.10(2008):1681-1693. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 200881101681.pdf（496KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment