基于分支限界搜索框架的测试用例自动生成
摘要
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.
引用本文（GB/T 7714）
Yawen Wang, Yunzhan Gong, Ying XING, 等. 基于分支限界搜索框架的测试用例自动生成[J]. Scientia Sinica Informationis, 2014.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。