A Multi-Objective Approach for Test Suite Reduction During Testing of Web Applications: A Search-Based Approach

A Multi-Objective Approach for Test Suite Reduction During Testing of Web Applications: A Search-Based Approach

Munish Khanna, Naresh Chauhan, Dilip Kumar Sharma, Law Kumar Singh
Copyright: © 2021 |Volume: 12 |Issue: 3 |Pages: 42
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781799861140|DOI: 10.4018/IJAMC.2021070104
Cite Article Cite Article

MLA

Khanna, Munish, et al. "A Multi-Objective Approach for Test Suite Reduction During Testing of Web Applications: A Search-Based Approach." IJAMC vol.12, no.3 2021: pp.81-122. http://doi.org/10.4018/IJAMC.2021070104

APA

Khanna, M., Chauhan, N., Sharma, D. K., & Singh, L. K. (2021). A Multi-Objective Approach for Test Suite Reduction During Testing of Web Applications: A Search-Based Approach. International Journal of Applied Metaheuristic Computing (IJAMC), 12(3), 81-122. http://doi.org/10.4018/IJAMC.2021070104

Chicago

Khanna, Munish, et al. "A Multi-Objective Approach for Test Suite Reduction During Testing of Web Applications: A Search-Based Approach," International Journal of Applied Metaheuristic Computing (IJAMC) 12, no.3: 81-122. http://doi.org/10.4018/IJAMC.2021070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

During the development and maintenance phases of evolving software, new test cases would be needed for the verification of the accuracy of the modifications as well as for new functionalities leading to an increase in the size of the test suite. Various related objectives are to be kept in mind while reducing the original test suite by removing redundancy and generating a practical representative set of the unique test cases, some of which may need to be maximized and the remaining ones minimized. This paper presents a multi-objective approach for the test suite reduction problem in which one objective is to be minimized and the remaining two maximized. In this study, experiments were performed on diverse versions of four web applications. Various state-of-the-art algorithms and their updated versions were compared with non-dominated sorting genetic algorithm-II (NSGA-II) for performance evaluation. Based on experimental findings, it was concluded that NSGA-II outperforms all other algorithms; moreover, the algorithm attempts to satisfy all the objectives without compromising coverage.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.