Welcome to the InfoSci Platform
Reference Hub3
Search for Prioritized Test Cases during Web Application Testing

Search for Prioritized Test Cases during Web Application Testing

Munish Khanna, Naresh Chauhan, Dilip Kumar Sharma
Copyright: © 2019 |Volume: 10 |Issue: 2 |Pages: 26
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781522566076|DOI: 10.4018/IJAMC.2019040101
Cite Article Cite Article

MLA

Khanna, Munish, et al. "Search for Prioritized Test Cases during Web Application Testing." IJAMC vol.10, no.2 2019: pp.1-26. http://doi.org/10.4018/IJAMC.2019040101

APA

Khanna, M., Chauhan, N., & Sharma, D. K. (2019). Search for Prioritized Test Cases during Web Application Testing. International Journal of Applied Metaheuristic Computing (IJAMC), 10(2), 1-26. http://doi.org/10.4018/IJAMC.2019040101

Chicago

Khanna, Munish, Naresh Chauhan, and Dilip Kumar Sharma. "Search for Prioritized Test Cases during Web Application Testing," International Journal of Applied Metaheuristic Computing (IJAMC) 10, no.2: 1-26. http://doi.org/10.4018/IJAMC.2019040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Regression testing of evolving software is a critical constituent of the software development process. Due to resources constraints, test case prioritization is one of the strategies followed in regression testing during which a test case that satisfies predefined objectives the most, as the tester perceives, would be executed the earliest. In this study, all the experiments were performed on three web applications consisting of 65 to 100 pages with lines of code ranging from 5000 to 7000. Various state-of-the-art approaches such as, heuristic approaches, Greedy approaches, and meta heuristic approaches were applied so as to identify the prioritized test sequence which maximizes the value of average percentage of fault detection. Performance of these algorithms was compared using different parameters and it was concluded that the Artificial Bee Colony algorithm performs better than all. Two novel greedy algorithms are also proposed in the study, of which the goal is to smartly manage the state of a tie, where a tie exhibits the condition that all the test cases participating in the tie are of equal significance in achieving the objective. It has also been validated that the performance of these novel proposed algorithm(s) is better than that of traditionally followed greedy approach, most of the time.

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.