Abstract：To improve the efficiency of combinatorial testing and reduce the numbers of test cases of combinatorial test, based on matrix repeat degree, an algorithm was proposed to generate the minimum numbers of test cases. An input matrix was generated based on the numbers of factors and the value numbers of each factors. The initial solution matrix was generated by comparing repeat degree of input matrix. The solution matrix was verified to decide whether all combinations of factors were covered, and the uncovered combinations of factors were recorded. To obtain the final solution matrix, the greedy algorithm was used to cover the uncovered combinations of factors. Each row of the solution matrix was a valid test case. The proposed approach was compared with the common combinatorial testing tools of ACTS and PICT for low factors cover, high factors cover and various different parameters. The experimental results show that the proposed approach can generate less numbers of test cases to ensure that all factor combinations are covered. The proposed approach is superior to ACTS and PICT, which proves to be feasible and effective.
2016, Vol. 37 
