Abstract: There exist constraint relations among parameters for most of the software system under test. If these relations are not taken into account, some of the combinations in the test suite make no sense. Therefore this paper proposes a combination test method in presence of parameter constraints. The method uses backtracking algorithm to traverse the tree and meanwhile the branches of solution space tree are cut using the constraint relations among parameters to avoid invalid test cases. Then some test data is added into the test case by a greedy algorithm to cover all the uncovered pairs. Experimental result shows that this method can reduce the generation number of test cases, and improve the efficiency of test.

Key words: combinatorial test, Solution Space Tree(SST), parameter constraint, test set, test case

摘要： 大多数待测软件系统的参数间存在约束关系，如果不考虑这些约束，会使测试用例集中的某些组合无效。为此，提出一种带参数约束的两两组合测试用例集生成方法。在采用回溯算法对解空间树进行遍历的同时，利用参数间的约束关系对树的枝叶进行裁剪，避免产生无效的测试用例。使用贪心算法补充生成测试用例，以满足两两组合覆盖标准。实验结果表明，该方法能减少测试用例生成数量，提高测试效率。

关键词: 组合测试, 解空间树, 参数约束, 测试集, 测试用例

CLC Number: 

• TP311