一种改进的两两组合测试用例生成方法

Pairwise Covering Test Data Generation Based on Solution

本文针对多因素二水平系统提出:将所有的测试数据表示为一棵二叉解空间树,用回溯法对二叉解空间树进行路径搜索来生成测试用例,然后使用贪心算法生成补充的测试用例,以满足两两组合覆盖标准。使用这种方法生成的测试数据集具有很高的覆盖率。

This paper represents a method based on the solution space B-tree to produce test data for combination testing, which is and for System with Many 2-level factor, Pairwise testing is practical and effective for various types of software systems, and it is a key problem to generate test data for the pairwise coverage criterion. This paper represents all feasible test data as a solution space b-tree based on the combinatorial testing model, and suggests a backtrack approach to search a subset of paths in the b-tree for pairwise testing data generation. Then some test data may be added into the test data suite by a greedy algorithm to cover all the uncovered pairs. The empirical results show that the approach has high coverage rate.