Test Suite generation using Memetic algorithm on adaptive local search

Abstract

Testing is the process of evaluating quality and correctness of software. In testing, we always check different functions of application. Test cases are the measure component, which is required in testing the functions and conditions. Test case is nothing but a condition which we want to check. It is very difficult to add test cases manually, so that we generate set of test cases called Test Suite. To generate the test suite with high code coverage we apply Memetic algorithm. Code coverage is not only important factor in test suite but also measuring part of test suite. Code coverage measure used to describe the degree of source code program which is tested. Test case may have more than one goal so that we can check feasibility of particular goal. We have implement Memetic algorithm to find code coverage. Here we also applied Memetic algorithm on adaptive local search. In the evaluation it is found that code coverage of Memetic algorithm on adaptive local search is maximum than Memetic algorithm.