Institutional Repository
| backtracking algorithms and search heuristics to generate test suites for combinatorial testing | |
| Yan Jun; Zhang Jian | |
| 2006 | |
| Conference Name | 30th Annual International Computer Software and Applications Conference |
| Pages | 385-392 |
| Conference Date | SEP 17-21, |
| Conference Place | Chicago, IL |
| Publish Place | 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA |
| Publisher | 30th Annual International Computer Software and Applications Conference, Vol 1, Regular Papers/Panels, Proceedings |
| ISSN | 0730-3157 |
| ISBN | 0-7695-2655-1 |
| Department | Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China. |
| English Abstract | 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 |
| Keyword | 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 |
| Sponsorship | IEEE Comp Soc |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/12078 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 04020100.pdf（204KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment