SFLA-based heuristic method to generate software structural test data

32Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Software testing is one of the significant stages in software development life cycle which is a costly and time-consuming task. Automatic tests data generation is one of the traditional techniques to reduce the cost and time spent in software testing. Different evolutionary algorithms have been proposed to generate test data which cover target paths in a software program. In this paper, shuffled frog leaping algorithm (SFLA) is proposed to generate structural test data. The proposed SFLA algorithm is characterized by high convergence speed and simple implementation. In the proposed SFLA, branch coverage is used as the fitness function to generate effective test data. For comparing the performance of the proposed SFLA with genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO), and artificial bee colony (ABC), seven benchmark programs were used. The results indicated that the proposed SFLA has an average of 99.99% for branch coverage, average 99.97% for success rate, and 2.03 for the average number of generation for covering all branches.

Cite

CITATION STYLE

APA

Ghaemi, A., & Arasteh, B. (2020). SFLA-based heuristic method to generate software structural test data. Journal of Software: Evolution and Process, 32(1). https://doi.org/10.1002/smr.2228

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free