Abstract: In order to generate near-minimum test case sets in the pairwise test process, this paper proposes a pairwise test case generation algorithm based on contribution. It creates a set of ordered pair to satisfy a given combinatorial coverage criteria, based on which an initial test sets is generated, and reduces the number of test sets. Experimental results show that the algorithm is effective and has the characteristics of fewer test cases.

Key words: software test, test case set, pairwise test, contribution, ordered pair set

摘要： 为在两两组合测试中获得近似最小的测试用例集，提出一种基于贡献度的两两组合测试用例自动生成算法。生成满足覆盖要求的有序配对集，根据有序配对集生成初始用例集，对初始用例集进行简约，获得测试用例集。实验结果表明，该算法生成的测试用例数目较少，算法效率较高。

关键词: 软件测试, 测试用例集, 两两组合测试, 贡献度, 有序配对集

CLC Number: 

• TP311.5