Performance of the Pareto Envelope-Based Search Algorithm - II in Automated Test Case Generation

Performance of the Pareto Envelope-Based Search Algorithm - II in Automated Test Case Generation

Abhishek, Apoorva (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Software Engineering)

Panichella, A. (mentor)
Olsthoorn, Mitchell (mentor)
Stallenberg, D.M. (mentor)
Verwer, S.E. (graduation committee)

Delft University of Technology

Computer Science and Engineering

CSE3000 Research Project

2023-06-28

Software testing is an important yet time consuming task in the software development life cycle. Artificial Intelligence (AI) algorithms have been used to automate this task and have proven to be proficient at it. This research focuses on the automated testing of JavaScript programs, and builds upon the existing SynTest framework that is the current state of the art, with the Dynamic Many Objective Sorting Algorithm (DynaMOSA) being the best performing AI algorithm for test case generation. DynaMOSA uses the Non-Dominated Sorting Algorithm - II (NSGA-II) as its base algorithm, and adds modifications to it. This paper investigates whether the use of the Pareto Envelope Based Search Algorithm - II (PESA-II) as the base algorithm results in improved performance. The contributions of this research includes a modified PESA-II integrated into the SynTest framework, using inspiration from DynaMOSA. Moreover, we answer the question "How does the modified PESA- II perform compared to DynaMOSA in generating test cases for JavaScript programs?" The performance of the algorithms is measured based on the (branch and method) coverage of the test cases generated for a suite of JavaScript classes. The results show that the modified version of PESA-II outperforms the base version. However, neither manage to outperform DynaMOSA.

Software testing
Artifical Intelligence
Algorithms

http://resolver.tudelft.nl/uuid:7abfe1f3-52bc-4e3f-9f3d-62897ef07425

Student theses

bachelor thesis

© 2023 Apoorva Abhishek