Name
Abstract | ||
|---|---|---|
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 Karpu0027s 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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2905055.2905094 | ICTCS |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nishtha Jatana | 1 | 4 | 1.78 |
| Bharti Suri | 2 | 63 | 8.02 |
| Prateek Kumar | 3 | 0 | 0.34 |
| Bimlesh Wadhwa | 4 | 46 | 8.72 |