摘要
提出了一种新的基于约束和树模型的两两组合测试方法;该方法在树模型的基础上,利用约束关系对树进行裁剪,在此基础上使用回溯法搜索解空间树,选择出符合两两覆盖标准的最小规模的测试数据集,最后利用贪心算法补足测试数据集;实验数据表明在某些存在参数约束的软件系统中,使用该方法可以生成尽可能小的两两组合覆盖测试用例集,较大幅度地提高了搜索效率。
Taking constraints and tree--model as the basis, this paper proposes a new pairwise combinatorial testing method, which firstly uses the constraint relationships to reduce the tree, then suggests a backtrack approach to search the solution space tree, and finally generates the smallest test suite which meets the pairwise coverage criteria. After that, a greedy algorithm would be applied to make up the test data set. Experimental data show that in this way, a combination test suite could be generated as small as possible for software system with constraints so as to greatly improve the efficiency of the search.
出处
《计算机测量与控制》
北大核心
2013年第8期2036-2038,共3页
Computer Measurement &Control
基金
上海市优秀青年教师基金项目(yyy11048)
关键词
两两组合测试
参数约束
解空间树
测试数据集
pairwise combinatorial test
parameter constraints
solution space tree
test data suite
