Research on test suite reduction based on complementary strategy

To improve the efficiency of test suite reduction, a new algorithm CH (complementary heuristic) for test suite reduction is proposed with consideration of the complementary relationship between cases. CH searches for an optimal representative set by selecting all essential test cases, removing l-to-l redundant test cases, selecting test cases those meet a maximum number of requirements which are not yet satisfied, and using double combination selection mechanism which considers the complementary relationship between cases. Example shows that it is better than existing algorithms for test suite reduction under some specified conditions and it can gain more reduced test suite.