CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Empirical Validation of Test Case Generation based on All-edge Coverage Criteria

by Shveta Parnami, K.S. Sharma, Swati V. Chande
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 126 - Number 11
Year of Publication: 2015
Authors: Shveta Parnami, K.S. Sharma, Swati V. Chande
10.5120/ijca2015906219

Shveta Parnami, K.S. Sharma, Swati V. Chande . Empirical Validation of Test Case Generation based on All-edge Coverage Criteria. International Journal of Computer Applications. 126, 11 ( September 2015), 22-28. DOI=10.5120/ijca2015906219

@article{ 10.5120/ijca2015906219,
author = { Shveta Parnami, K.S. Sharma, Swati V. Chande },
title = { Empirical Validation of Test Case Generation based on All-edge Coverage Criteria },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 126 },
number = { 11 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 22-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume126/number11/22597-2015906219/ },
doi = { 10.5120/ijca2015906219 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:17:12.061747+05:30
%A Shveta Parnami
%A K.S. Sharma
%A Swati V. Chande
%T Empirical Validation of Test Case Generation based on All-edge Coverage Criteria
%J International Journal of Computer Applications
%@ 0975-8887
%V 126
%N 11
%P 22-28
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Software testing assesses the functionality and correctness of the software through analysis and execution. It is done by exercising appropriate number of test cases so that no part of the program is left untested. Presence of multiple loops in a program makes it unlikely or impossible to test all paths. Therefore researchers try to find the subsets of the test cases, which when tested give confidence of complete testing. However, the subsets of paths are based on some testing criteria. In this research paper GA approach has been used to find out the subset of paths of the test program that fulfills all edge coverage criteria. The Genetic Algorithm for Test Case Generation (GATCG) proposed in this work generates reduced number of paths for a test program. These paths are termed as prime paths. The proposed GATCG technique makes use of the concept of prime paths to reduce the cost of testing. The efficiency of proposed algorithm is established from the results, in terms of number of iterations and time consumed in generating the prime paths for test programs.

References
  1. Girgis, M. R., Ghiduk, A. S., & Abd-Elkawy, E. H. (2014). Automatic Generation of Data Flow Test Paths using a Genetic Algorithm. International Journal of Computer Applications, 89(12), 29-36.
  2. Ahmed, M. A., & Hermadi, I. (2008). GA-based multiple paths test data generator. Computers & Operations Research, 35(10), 3107-3124.
  3. Groce, A. (2009). (Quickly) testing the tester via path coverage. In Proceedings of the Seventh International Workshop on Dynamic Analysis (pp. 22-28). ACM.
  4. Sy, N. T., & Deville, Y. (2001). Automatic test data generation for programs with integer and float variables. In Automated Software Engineering, 2001.(ASE 2001). Proceedings. 16th Annual International Conference on (pp. 13-21). IEEE.
  5. Gotlieb, A., & Petit, M. (2010). A uniform random test data generator for path testing. Journal of Systems and Software, 83(12), 2618-2626.
  6. Harman, M., & McMinn, P. (2007). A theoretical & empirical analysis of evolutionary testing and hill climbing for structural test data generation. In Proceedings of the 2007 international symposium on Software testing and analysis (pp. 73-83). ACM.
  7. Gupta, N., Mathur, A. P., & Soffa, M. L. (2000). Generating test data for branch coverage. In Automated Software Engineering, 2000. Proceedings ASE 2000. The Fifteenth IEEE International Conference on (pp. 219-227). IEEE.
  8. Pargas, R. P., Harrold, M. J., & Peck, R. R. (1999). Test-data generation using genetic algorithms. Software Testing Verification and Reliability, 9(4), 263-282.
  9. Jones, B. F., Eyres, D. E., & Sthamer, H. H. (1998). A strategy for using genetic algorithms to automate branch and fault-based testing. The Computer Journal, 41(2), 98-107.
  10. Lu, S., Zhou, P., Liu, W., Zhou, Y., & Torrellas, J. (2006). Pathexpander: Architectural support for increasing the path coverage of dynamic bug detection. In Microarchitecture, 2006. MICRO-39. 39th Annual IEEE/ACM International Symposium on (pp. 38-52). IEEE.
  11. Hermadi, I., Lokan, C., & Sarker, R. (2010). Genetic algorithm based path testing: challenges and key parameters. In Software Engineering (WCSE), 2010 Second World Congress on (Vol. 2, pp. 241-244). IEEE.
  12. Parnami, S., Sharma, K. S., & Chande, S. V. (2012). A Survey on Generation of Test Cases and Test Data Using Artificial Intelligence Techniques. International Journal of Advances in Computer Networks and its Security, 2(1), 16-18.
  13. Faezeh, S. Babamir, Esmaeil Amini, S. Mehrdad Babamir, Ali Norouzi and Berk Burak Ustundag(2010), Genetic Algorithm and Software Testing based on Independent Path Concept, International Conference on Genetic and Evolutionary Methods-GEM'10, The 2010 World Congress in Computer Science, Computer Engineering and Applied Science, Las Vegas, Nevada, USA, July 2010.
  14. Ghiduk, A. S. (2014). Automatic generation of basis test paths using variable length genetic algorithm. Information Processing Letters, 114(6), 304-316.
  15. Ahmed, M. A., & Hermadi, I. (2008). GA-based multiple paths test data generator. Computers & Operations Research, 35(10), 3107-3124.
  16. Sthamer, H., Wegener, J., & Baresel, A. (2002). Using evolutionary testing to improve efficiency and quality in software testing. In Proc. of the 2nd Asia-Pacific Conference on Software Testing Analysis & Review.
  17. Sthamer, H. H. (1995). The automatic generation of software test data using genetic algorithms (Doctoral dissertation, University of Glamorgan).
  18. Gold, R. (2010). Control flow graphs and code coverage. International Journal of Applied Mathematics and Computer Science, 20(4), 739-749.
  19. Beizer,B. (1990), Software Testing Techniques, Second Edition, Van Nostrand Reinhold Company Limited, ISBN 0-442-20672-0.
  20. Singh, H. (2004). Automatic generation of software test cases using genetic algorithms. a thesis in Thapar University Patiala may2004.
  21. Faezeh, S. Babamir, Esmaeil Amini, S. Mehrdad Babamir, Ali Norouzi and Berk Burak Ustundag(2010), Genetic Algorithm and Software Testing based on Independent Path Concept, International Conference on Genetic and Evolutionary Methods-GEM'10, The 2010 World Congress in Computer Science, Computer Engineering and Applied Science, Las Vegas, Nevada, USA, July 2010.
  22. Gerritsen, M. (2008). Extending T2 with prime path coverage exploration (Doctoral dissertation, Master’s thesis, Dept. Inf. and Comp. Sciences, Utrecht Univ., 2008. Available at: http://www. cs. uu. nl/wiki/WP/T2Framework).
  23. Goldberg,D.E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, Mass.
  24. Jones, B. F., Sthamer, H. H., & Eyres, D. E. (1996). Automatic structural testing using genetic algorithms. Software Engineering Journal, 11(5), 299-306.
  25. Lin, J. C., & Yeh, P. L. (2000). Using genetic algorithms for test case generation in path testing. In Test Symposium, 2000.(ATS 2000). Proceedings of the Ninth Asian (pp. 241-246). IEEE.
  26. Alba, E., & Chicano, F. (2008). Observations in using parallel and sequential evolutionary algorithms for automatic software testing. Computers & Operations Research, 35(10), 3161-3183.
  27. Sagarna, R., & Yao, X. (2008). Handling constraints for search based software test data generation. In Software Testing Verification and Validation Workshop, 2008. ICSTW'08. IEEE International Conference on (pp. 232-240). IEEE.
  28. Pei, M., Goodman, E. D., Gao, Z., & Zhong, K. (1994). Automated software test data generation using a genetic algorithm. Michigan State University, Tech. Rep, (1), 1-15.
  29. Ghiduk, A. S., & Girgis, M. R. (2010). Using genetic algorithms and dominance concepts for generating reduced test data. Informatica, 34(3).
  30. Kumar, R. (2012). Blending roulette wheel selection & rank selection in genetic algorithms. International Journal of Machine Learning and Computing, 2(4), 365.
Index Terms

Computer Science
Information Sciences

Keywords

Prime paths Test case generation Testing cost Genetic algorithm.

Powered by PhDFocusTM