IJTEEE

Open Access Journal of Scientific, Technology & Engineering Research


International Journal of Technology Enhancements and Emerging Engineering Research (ISSN 2347-4289)
QUICK LINKS
CURRENT PUBLICATIONS



IJTEEE >> Volume 3 - Issue 6, June 2015 Edition



International Journal of Technology Enhancements and Emerging Engineering Research  
International Journal of Technology Enhancements and Emerging Engineering Research

Website: http://www.ijteee.org

ISSN 2347-4289



Genemutant: Test Suite Adequacy Check For Path Coverage Testing Based On Mutating Test Suite Using Genetic Algorithm

[Full Text]

 

AUTHOR(S)

Dr Namita Gupta

 

KEYWORDS

Keywords : Genetic algorithm, Mutation testing, Path testing

 

ABSTRACT

ABSTRACT: Code coverage is a measure used to describe the degree to which the source code of a program is tested by a particular test suite. A program with high code coverage has been more thoroughly tested and has a lower chance of containing software bugs than a program with low code coverage. Many different metrics can be used to calculate code coverage like statement coverage, decision coverage, condition coverage, path coverage etc. Path coverage ensures that every independent path in the program should be executed at least once by the give test suite. The proposed technique check the adequacy of given test suite and design new test cases (if required) by mutating the existing test cases, for path coverage testing based on genetic algorithm using XNOR fitness function.

 

REFERENCES

[1] N.K. Gupta and M.K. Rohil, “Using Genetic Algorithm For Unit Testing Of Object Oriented Software”, Proceedings of the International Conference on Emerging Trends in Engineering and Technology, 16-18 July 2008, pp. 308-313,.

[2] M. Mitchell, An Introduction to Genetic Algorithms, MIT press, 1996.

[3] Praveen Ranjan Srivastava and Tai-hoon Kim, “Application of Genetic Algorithm in Software Testing”, International Journal of Software Engineering and Its Applications , vol. 3, no. 4, October 2009, pp. 87-95.

[4] RICCARDO POLI AND W.B. LANGDON, “GENETIC PRO-GRAMMING WITH ONE-POINT CROSSOVER AND POINT MUTATION”, SOFT COMPUTING IN ENGINEERING DESIGN AND MANUFACTURING, 1997, PP. 180-189.

[5] Sean Luke and Lee Spector, “A Revised Comparison of Crossover and Mutation in Genetic Programming”, Proceedings of the Second Annual Conference on Genetic Programming 1997, 1998, pp. 240-248.

[6] Leonardo Bottaci, “A Genetic Algorithm Fitness Function for Mutation Testing”, Proceedings of the first International Workshop on Software Engineering using Metaheuristic Innovative Algo-rithms, Toronto, Ontario, Canada, May 2001.

[7] Tzung-pei Hong , Hong-shung Wang , Wen-yang Lin and Wen-yuan Lee, “Evolution of appropriate crossover and mutation operators in a genetic process”, Applied Intelligence, Vol. 16, 2002, pp. 7-17.

[8] MARIA CLÁUDIA FIGUEIREDO PEREIRA EMER, AND SILVIA REGINA VERGILIO, “GPTEST: A TESTING TOOL BASED ON GENETIC PROGRAMMING”, PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO 2002), SEPTEMBER 2002, PP. 1343-1350.

[9] Wen-Yang Lin, Wen-Yung Lee and Tzung-Pei Hong, “Adapting Crossover and Mutation Rates in Genetic Algorithms”, Journal Of Information Science And Engineering, Vol. 19, 2003, pp. 889-903.

[10] Abdelaziz M. Khamis, Moheb R. Girgis and Ahmed S. Ghiduk, “Automatic Software Test Data Generation for Spanning Sets Coverage Using Genetic Algorithms”, Computing and Informatics, vol. 26, no. 4, 2007, pp. 383–401.

[11] LAWRENCE BEADLE AND COLIN G JOHNSON, “SEMANTICALLY DRIVEN MUTATION IN GENETIC PROGRAMMING”, PROCEEDINGS OF THE IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2009), 2009, PP. 1336-1342.

[12] WILLIAM B. LANGDON, MARK HARMAN AND YUE JIA, “MULTI OBJECTIVE HIGHER ORDER MUTATION TESTING WITH GENETIC PROGRAMMING”, TESTING: ACADEMIC AND INDUSTRIAL CONFERENCE - PRACTICE AND RESEARCH TECHNIQUES, 2009 (TAIC PART '09. ), 4-6 SEPT. 2009, PP., 21-29.

[13] WANG JUN , ZHUANG YAN AND JIANYUN CHEN, “TEST CASE PRIORITIZATION TECHNIQUE BASED ON GENETIC ALGORITHM”, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTERNET COMPUTING & INFORMATION SERVICES (ICICIS), 17-18 SEPT. 2011, PP. 173 – 175.

[14] PRENAL B. NIRPAL AND K.V. KALE, “USING GENETIC ALGORITHM FOR AUTOMATED EFFICIENT SOFTWARE TEST CASE GENERATION FOR PATH TESTING”, INTERNATIONAL JOURNAL OF ADVANCED NETWORKING AND APPLICATIONS, VOL. 2, NO. 6, 2011, PP. 911-915.

[15] TIMO KÖTZING, ANDREW M. SUTTON, FRANK NEUMANN AND UNA-MAY O’REILLY, “THE MAX PROBLEM REVISITED: THE IMPORTANCE OF MUTATION IN GENETIC PROGRAMMING”, PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION (GECCO’12), JULY 7–11, 2012, PP. 1333-1340.

[16] Chayanika Sharma, Sangeeta Sabharwal, Ritu Sibal, “A Survey on Software Testing Techniques using Genetic Algorithm”, IJCSI International Journal of Computer Science Issues, vol. 10, issue 1, no 1, January 2013, pp. 391-393.