| Title: | backtracking algorithms and search heuristics to generate test suites for combinatorial testing |
| Author: | Yan Jun
; Zhang Jian
|
| Conference Name: | 30th Annual International Computer Software and Applications Conference
|
| Conference Date: | SEP 17-21,
|
| Issued Date: | 2006
|
| Conference Place: | Chicago, IL
|
| 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
|
| Publisher: | 30th Annual International Computer Software and Applications Conference, Vol 1, Regular Papers/Panels, Proceedings
|
| Publish Place: | 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
|
| ISSN: | 0730-3157
|
| ISBN: | 0-7695-2655-1
|
| Department: | Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
|
| Sponsorship: | IEEE Comp Soc
|
| 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 |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/12078
|
| Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| 04020100.pdf（204KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
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,.
|
|
|
