Test Suite Reduction by Mutation Testing Mapped to Set Cover Problem
Nishtha Jatana, Bharti Suri, Prateek Kumar, Bimlesh Wadhwa · 2016
This paper presents a novel approach for reduction of test cases in a test suite using mutation testing. The proposed approach maps the problem of reduction of test cases to the set cover problem which is one of the Karp's originally proposed 21 NP hard problems. The solution to the problem uses a Greedy Approach to find the reduced test suite. Our preliminary evaluation on three programs (Triangle problem, Quadratic problem and TCAS) shows encouraging results.