Test Suite Reduction Using Weighted Set Covering Techniques

Effective testing can develop quality software with higher productivity at a lower cost. Redundancy in the test suite increases the execution cost and consumes scarce project resources. Due to time and resource constraints in testing, test suite reduction techniques are required to remove those redundant test cases from the test suite. Since Weighted Set Covering Techniques can be used to resolve the test suite minimization, the paper presents a novel approach, called as Modified Greedy Algorithm, based on the Weighted Set Covering Problem (WSC). The WSC is, given S, for each set s ∈S a weight w_s>;0 is also specified, and the goal is to find a set cover C of minimum total weight Σ_s∈Cw_s. The research aimed to reduction of the test suite which generated by Student Achievement Retrieval Navigation Model. Through comparing with existing algorithms, our algorithm can not only produce the minimum test suite is the smallest, but also minimum the total cost.