IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v12y2021i3p81-122.html
   My bibliography  Save this article

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

Author

Listed:
  • Munish Khanna

    (Hindustan College of Science and Technology, Mathura, India)

  • Naresh Chauhan

    (YMCA University of Science and Technology, Faridabad, India)

  • Dilip Kumar Sharma

    (GLA University, Mathura, India)

  • Law Kumar Singh

    (Hindustan College of Science and Technology, Mathura, India)

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.

Suggested Citation

  • Munish Khanna & Naresh Chauhan & Dilip Kumar Sharma & Law Kumar Singh, 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), IGI Global, vol. 12(3), pages 81-122, July.
    • Handle: RePEc:igg:jamc00:v:12:y:2021:i:3:p:81-122
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2021070104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:12:y:2021:i:3:p:81-122. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.