基于树模型和输入参数关系的组合测试集精简方法  

Reducing combinatorial test suite based on tree-model by using input parameters relationships

作　　者：王立新[1,2] 杨峻[3] 万仁霞[1] 王铭军[1] 

机构地区：[1]东华大学信息科学与技术学院,上海201620 [2]安徽建筑工业学院电子与信息工程学院,合肥230022 [3]安阳师范学院数学系,河南安阳455002

出　　处：《计算机应用研究》2010年第3期928-932,937,共6页Application Research of Computers

基　　金：东华大学博士创新基金资助项目(BC200817)

摘　　要：提出了一种精简组合测试用例集的方法,该方法基于解空间树模型,利用输入参数之间的依赖关系来剪裁解空间树中的枝叶,从而获得精简的组合测试用例集。该方法采用回溯算法来实现,在遍历树的同时,剪裁解空间树并输出组合测试用例。在算法的实现过程中,采用了一些策略以便提高算法的效率并节省空间。实验结果证明该方法是可行和有效的,对于一些输入参数依赖关系明确的被测系统,该方法能够较大幅度地精简全组合测试用例集。This paper proposed a method to reduce combinatorial test suite. The main idea of the method was based on a solution space tree model and input parameters relationships. It first analyzed the dependent relationships among input parameters, and used the relationships to reduce a solution space tree breaches and then generated a small combinatorial test suite. It used back tracking algorithm to realize the idea of the method, and used some strategies to reduce the requirement of space and improve speed of the algorithm effectively. The experiments and case study show that the method is feasible and effective, and it can considerably reduce the number of combillatorial test cases for some SUT with definite dependent relationships among input parameters.

关 键 词：组合测试 解空间树 依赖关系 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]