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 |
| 会议日期 | SEP 17-21, |
| 会议地点 | Chicago, IL |
| 关键词 | 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 |
| 页码 | 385-392 |
| 英文摘要 | 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 |
| 会议主办者 | IEEE Comp Soc |
| 会议录出版者 | 30th Annual International Computer Software and Applications Conference, Vol 1, Regular Papers/Panels, Proceedings |
| 会议录出版地 | 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA |
| ISSN号 | 0730-3157 |
| ISBN号 | 0-7695-2655-1 |
| 源URL | [http://124.16.136.157/handle/311060/12078]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _会议论文 |
| 推荐引用方式 GB/T 7714 | Yan Jun,Zhang Jian. backtracking algorithms and search heuristics to generate test suites for combinatorial testing[C]. 见:30th Annual International Computer Software and Applications Conference. Chicago, IL. SEP 17-21,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。