1. Test Suite Reduction via Evolutionary Clustering
- Author
-
Chunyan Xia, Yan Zhang, and Zhanwei Hui
- Subjects
General Computer Science ,Computer science ,General Engineering ,Evolutionary algorithm ,Code coverage ,Regression testing ,020207 software engineering ,Failure rate ,02 engineering and technology ,Fault detection and isolation ,test suite reduction ,Reduction (complexity) ,Test case ,Software bug ,genetic algorithm ,0202 electrical engineering, electronic engineering, information engineering ,Test suite ,020201 artificial intelligence & image processing ,General Materials Science ,lcsh:Electrical engineering. Electronics. Nuclear engineering ,Cluster analysis ,lcsh:TK1-9971 ,Algorithm ,cluster analysis - Abstract
Test suite reduction is an effective way to reduce the cost of regression testing by identifying and removing redundant test cases from the original test suite. In this paper, we propose a novel cluster test suite reduction using an evolutionary multi-objective optimization algorithm. Specifically, we use a K-means algorithm to group similar test cases to the same cluster. Then the evolutionary algorithm is used to remove redundant test cases based on the clustering results, and optimization objects are represented as the coverage-related criteria, fault-related criteria and cost-related criteria. The experimental results involving eight subject programs show that the proposed method can outperform the other three state-of-the-arts with respect to both fault detection (4.61% -9.44%) and reduction ratio (4.10% -10.64%). Meanwhile, the experiments also prove that our method has a better performance of missing failure rate (0.049% -0.132%) and code coverage rate (3.34% -6.10%). Besides, the proposed method costs are found to be comparable to the other techniques.
- Published
- 2021
- Full Text
- View/download PDF