The design of test-cases is one of the most important parts of software testing, which play an important role in guiding the post-testing and also is the fundamental guarantee of quality software. For the shortcoming of method raised by Moheb R. Girgis, an improved genetic algorithm for the automatic generation of data flow test-cases was proposed by introducing the branch functions and adaptive genetic strategies. Experiments show that the improved algorithm has a more increase in the performance of convergence rate and coverage rate.
1 Harman M, Mcminn P, Wegener J. The impact of input domain reduction on search based test data generation. Antonia Bertolinoed. Proc. of the the 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on The Foundations of Software Engineering. New York: ACM Press, 2007: 155-156.
2 Zheng L, Harman M, Hierons RM. Search algorithm for regression test case prioritization. IEEE Trans. on Software Engineering, 2007,33(4):225-228.
3 Berndt D, Fisher J, Johnson, et al. Breeding software testcases with genetic algorithm. Proc. of the 36th Hawaii International Conference on System Sciences. IEEE Press, 2002:1-4.
4 Bryce RC, Colbourn CJ. Constructing interaction test suites with greedy algorithm. The Proc. of ASE’05. Califormina, ACM Press, 2005. 124-136.
6 Girgis MR. Automatic test data generation for data flow testing using a genetic algorithm. Journal of Universal Computer Science, 2005,11(6):898-915.
7 Rapps S, Weyuker EJ. Selecting software test data using data flow information. IEEE Trans. on Software Engineering, 1985,11(4):367-375.
8 Frankl PG, Weyuker EJ. An applicable family of data flow testing criteria. IEEE Trans. on Software Engineering, 1988: 1483-1498.
10 AHmed SG, Harrold MJ. Using genetic algorithms to aid test-data generation for data-flow coverage. Proc. of the 14th Asia-Pacific Software Engineering Conference. Nagoya: IEEE Press, 2007: 41-48.