Reduction algorithm based on invariant for pairwise test sets
Jiaze Sun · 2012
A novel test suite reduction algorithm based on program invariant for pair wise test sets is presented to solve the problem of test suite reduction.Firstly a combinatorial test case is generated with the strategy of one test at a time,then program invariant is abstracted through running the new test case to decided the test case is selected or not.The imitate results manifest that the novel test suite reduction algorithm is an effective algorithm for pair wise test sets reduction,which reduces the number of the test cases and enhances the quality of the test sets.