基于矩阵行列变换的测试用例约简算法

针对测试用例约简问题,定义了一种不会改变测试需求与测试用例覆盖关系的布尔运算。应用此运算,辅以不同的测试需求、用例集优先策略,经矩阵的列变换得到精简的测试需求集,然后使用行变换对测试用例集进行约简。该方法不受测试用例输入顺序的影响。实验表明,与一些常用的约简算法相比,提出的算法在有序树生成程序测试用例约简的几个实例上都能得到较优的用例集。

Test suites reduction based on matrix transformation

In allusion to the problem of test requirements reduction, this paper defined a new Boolean operation of the relationships which didn't change the coverage of test suites to test requirements. Redundance requirements was reducted by column transformation operation of matrix basis of the interrelations among the testing requirements, then test suites could be reducted by row transformation operation of matrix. The experimental results based on several cases shows that, compared with some other existed methods, this method has better property that can generate the minimal test suite to test all the test requirements sufficiently.