| 基于分支限界搜索框架的测试用例自动生成 |
| |
| 引用本文： | 邢颖,宫云战,王雅文,张旭舟.基于分支限界搜索框架的测试用例自动生成[J].中国科学:信息科学,2014(10):1345-1360. |
| |
| 作者姓名： | 邢颖 宫云战 王雅文 张旭舟 |
| |
| 作者单位： | 北京邮电大学网络与交换技术国家重点实验室;辽宁工程技术大学电子与信息工程学院;中国科学院计算技术研究所; |
| |
| 基金项目： | 国家自然科学基金(批准号:61202080,91318301);国家高技术研究发展计划(863)(批准号:2012AA011201)资助项目 |
| |
| 摘 要： | 作为软件测试领域的一个基本问题和热点问题,面向路径的测试用例自动生成有着特殊的重要意义.面向路径的测试用例生成本质上是一个约束满足问题,并通过搜索算法求解.着眼于提升搜索算法的效率,本文提出了一种新的智能算法,将分支限界和爬山法进行了有机的整合,分支限界作为全局搜索算法,而爬山法作为局部搜索算法,发挥各自的优势来对测试用例的解空间进行搜索.
|
| 关 键 词： | 面向路径 测试用例生成 约束满足问题 分支限界 爬山法 |
Branch and bound framework for automatic test case generation |
| |
| Institution: | XING Ying, GONG YunZhan, WANG YaWen , ZHANG XuZhou (1 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2 School of Electronic and Information Engineering, Liaoning Technical University, Huludao 125105, China; 3 Institute of Computing Technology, Chinese Academy of Science, Beijing 100190, China) |
| |
| Abstract: | As a basic problem and a hotspot in software testing, the automation of path-wise test case generation is of special importance, which is in essence a constraint satisfaction problem solved by search strategies. Therefore, the constraint processing efficiency of the selected search algorithm is a key factor. Aiming at the increase of search efficiency, a hybrid intelligent algorithm is proposed to efficiently search the solution space of potential test cases by making full use of both global and local search methods. Branch and bound is adopted for global search, and hill climbing is adopted for local search. They are highly integrated to form an efficient search framework. |
| |
| Keywords: | path-wise test case generation constraint satisfaction problem branch and bound hill climbing |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
