backtracking algorithms and search heuristics to generate test suites     for combinatorial testing

	backtracking algorithms and search heuristics to generate test suites for combinatorial testing
	Yan Jun; Zhang Jian
	2006
会议名称	30th Annual International Computer Software and Applications Conference
页码	385-392
会议日期	SEP 17-21,
会议地点	Chicago, IL
出版地	10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
出版者	30th Annual International Computer Software and Applications Conference, Vol 1, Regular Papers/Panels, Proceedings
ISSN	0730-3157
ISBN	0-7695-2655-1
部门归属	Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
摘要	Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach and a backtracking search algorithm are presented to solve the prob
关键词	Sat-based Approach Backtracking Search Algorithm Exhaustive Search Of Combinatorial Test Suite Pruning Strategy Search Heuristics Subcombination Equalization Heuristic Symmetry Breaking Technique Backtracking Combinatorial Mathematics Computability
主办者	IEEE Comp Soc
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12080
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Yan Jun,Zhang Jian. backtracking algorithms and search heuristics to generate test suites for combinatorial testing[C]. 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA:30th Annual International Computer Software and Applications Conference, Vol 1, Regular Papers/Panels, Proceedings,2006:385-392.

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