Evolutionary algorithms for path coverage test data generation and optimization: a review

Deepti Bala Mishra, Arup Abhinna Acharya, Rajashree Mishra

Abstract


Software testing is very time consuming, labor-intensive and complex process. It is found that 50% of the resources of the software development are consumed for testing. Testing can be done in two different ways such as manual testing and automatic testing. Automatic testing can overcomes the limitations of manual testing by decreasing the cost and time of testing process. Path testing is the strongest coverage criteria among all white box testing techniques as it can detect about 65% of defects present in a SUT. With the help of path testing, the test cases are created and executed for all possible paths which results in 100% statement coverage and 100% branch coverage .This paper presents a systematic review of test data generation and optimization for path testing using Evolutionary Algorithms (EAs). Different EAs like GA, PSO, ACO, and ABCO based methods has been already proposed for automatic test case generation and optimization to achieve maximum path coverage.

Keywords


Path Testing; Genetic Algorithm (GA); Particle Swarm Optimization (PSO); Ant Colony Optimization (ACO); Artificial Bee Colony (ABC);

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v15.i1.pp504-510

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics