a backtracking search tool for constructing combinatorial test suites

	a backtracking search tool for constructing combinatorial test suites
	Jun Yan; Zhang Jian
	2008
发表期刊	Journal of Systems and Software
卷号	81 期号:10 页码:1681-1693
摘要	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.
收录类别	ei
关键词	Software Testing Combinatorial Testing Optimal Test Set Covering Array Orthogonal Array
部门归属	计算机科学国家重点实验室
语种	英语
WOS记录号	WOS:000259427100005
引用统计	被引频次：27[WOS] [WOS记录] [WOS相关记录]
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/3136
专题	基础软件与系统重点实验室
推荐引用方式 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.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
200881101681.pdf（496KB）			开放获取	--	请求全文