Indian Journal of Science and Technology

Abstract

Background/Objective: Problem description/Proposed Method: The objective is to minimize ambiguous test cases by using Adaptive Genetic Algorithm (AGA). Here we are concerned with the problem of randomly generated test cases. It can contain some ambiguous test cases, which lead to problems at the organizational level. A random algorithm will generate random test cases each time it is run, and it will have resemblance each time. Another problem related to random algorithms is that running them can take a lot of time. To minimize these issues we propose a new technique, which will reduce the given drawbacks. We proposed an Adaptive Genetic Algorithm (AGA), which will provide legal input in each case where it applied. Thus the problem of ambiguity will decrease.
Results/Findings: In this research, the near optimal inputs will be generated based on the Adaptive Genetic Algorithm (AGA), which will reduce the illegal inputs. The fault detection rate is used as the fitness function in AGA. To remove the fault proneness, our AGA uses the coverage metrics of the test cases.
Conclusion: Random algorithms will generate low cost test cases in large number but problem is that it will consists ambiguous test cases ,to reduce these here we are using AGA which will further reduce test cases by moderating the illegal inputs.

Keywords: Reliability, Software Metrics, Software Quality