【摘要】 为了对测试用例集进行有效化简,提出了一种考虑测试用例间互补关系的测试用例集简化算法CH.该算法通过挑选所有的必不可少测试用例、剔除1-1冗余测试用例、选择能够最大程度满足未被满足的测试需求的测试用例、应用考虑元素间互补关系的双组合选入机制,寻找优化代表集.实例研究表明,在一些测试条件下该算法优于现有的几种测试用例集简化算法.利用该算法,可以得到更精简的测试用例集.更多还原

【Abstract】 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.更多还原