具有约束条件的组合测试用例集的构建方法  

Method of constructing combinatorial test suites in presence of constraints

作　　者：丁怀宝[1] 高建华[1] 

机构地区：[1]上海师范大学计算机科学与工程系,上海200234

出　　处：《计算机工程与设计》2010年第14期3189-3192,3206,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(60673067);上海市教育委员会科研创新基金项目(0922135);上海市科委基金项目(09220503000)

摘　　要：针对如何为存在约束条件的软件系统生成尽可能小的组合测试用例集问题,提出了基于组合测试算法的约束组合测试法。该方法是对待测系统中的约束条件进行处理,将约束条件先转化为合取范式再转化为布尔表达式的形式。利用布尔可满足性求解器进行求解,找出满足约束条件的约束组合测试用例。最后运用AETG-SAT算法得到较优的组合测试用例集,并通过实验表明了AETG-SAT算法的优越性。Aimed at the problems of how to generate a combination test suite as small as possible for software system with constraints. A new combination testing method is presented. First,the constraints are processed in the software system,namely,the constraints are converted to conjunctive normal form,and then converted to Boolean expression. Then,using Boolean satisfiability （SAT） solvers to solve,constrained combination test cases are found out,which meet the constraints. Finally,making use of AETG-SAT algorithm get a better combination test suite,and it is verified better than others by experiments.

关 键 词：组合测试 约束条件 合取范式 布尔表达式 可满足性求解器 

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