Method of constructing combinatorial test suites in presence of constraints
Gao Jian-hua · Jisuanji gongcheng yu sheji · 2010
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.