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

Generation of Optimal Testing Paths using Anti –Ant Colony Algorithm

by Abdullah H. Ahmed, Dujan B. Taha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 49
Year of Publication: 2018
Authors: Abdullah H. Ahmed, Dujan B. Taha
10.5120/ijca2018917266

Abdullah H. Ahmed, Dujan B. Taha . Generation of Optimal Testing Paths using Anti –Ant Colony Algorithm. International Journal of Computer Applications. 179, 49 ( Jun 2018), 20-25. DOI=10.5120/ijca2018917266

@article{ 10.5120/ijca2018917266,
author = { Abdullah H. Ahmed, Dujan B. Taha },
title = { Generation of Optimal Testing Paths using Anti –Ant Colony Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2018 },
volume = { 179 },
number = { 49 },
month = { Jun },
year = { 2018 },
issn = { 0975-8887 },
pages = { 20-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume179/number49/29508-2018917266/ },
doi = { 10.5120/ijca2018917266 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:58:46.209899+05:30
%A Abdullah H. Ahmed
%A Dujan B. Taha
%T Generation of Optimal Testing Paths using Anti –Ant Colony Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 49
%P 20-25
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The most important issue for software industry is to ensure software quality. The software that delivered to the end user must have high quality that meets user requirements. Software must be tested to ensure its quality. In the context of the path-based testing it is important to find the optimal paths from all possible code execution paths to reduce testing process cost and time. The optimal paths are the less number of the paths that cover all source code statements. The proposed algorithm accepts java source code as an input and generates the control flow graph(CFG) corresponding to that code. Using anti-ant colony optimization, the optimal paths corresponding to the source code will be generated. The proposed algorithm determines the minimum set of paths that cover all source code statements efficiently and accurately.

References
  1. Xinyang Wang , Yaqiu Jiang, and Wenhong Tian, "An Efficient Method for Automatic Generation of Linearly Independent Paths in White-box Testing," International Journal of Engineering and Technology Innovation, vol. 5, no. 2, pp. 108-120, 2015.
  2. Mukesh Mann and Om Prakash Sangwan , "Generating and prioritizing optimal paths using ant colony optimization, " Computational Ecology and Software, 5(1): 1-15, 2015.
  3. Roger S. Pressman, Software Engineering A practitioner’s approach 7th Edition. 2010.
  4. Hina Sattar , Imran Sarwar Bajwa , and Umar Farooq Shafi , "Automated DD-path Testing and its Significance in SDLC Phases," Journal of Digital Information Management, Volume 13, Number 5, 2015.
  5. Saurabh Srivastava, Sarvesh Kumar, and Ajeet Kumar Verma, "Optimal Path Sequencing in Basis Path Testing," International Journal of Advanced Computational Engineering and Networking, ISSN (p): 2320-2106, Volume – 1, Issue – 1, 2013.
  6. Robert Gold, "Control Flow Graphs And Code Coverage," Int. J. Appl. Math. Comput. Sci., Vol. 20, No.4, 739–749, 2010.
  7. Bhuvnesh Sharma, Isha Girdhar, Monika Taneja, Pooja Basia, Sangeetha Vadla, and Praveen Ranjan Srivastava, "Software Coverage : A Testing Approach through Ant Colony Optimization," B.K. Panigrahi et al. (Eds.): SEMCCO 2011, Part I, LNCS 7076, pp. 618–625, 2011. © Springer-Verlag Berlin Heidelberg 2011.
  8. Wang, Y.; Xie, J. Y. Ant colony optimization for multicast routing in Circuits and Systems. IEEE: The 2000 IEEE Asia-Pacific Conference; 2000; pp 54-57.
  9. M. Dorigo, C. Blum, Ant colony optimization theory: a survey, Theor. Comput. Sci. 344 (2005) 243–278.
  10. Silva, A. R. M.; Ramalho, G. L. Ant system for the set covering problem Systems.2001 IEEE International Conference on Man and Cybernetics;2001; Vol. 5, pp 3129-3133.
  11. M. Dorigo, V. Maniezzo, and A. Colorni. Ant Systems: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26: 1996, 29-41
  12. J. Lin, P. Yeh., “Using Genetic Algorithms for Test Case Generation in Path Testing,” Proceedings of the Ninth Asian on Test Symposium, Asian, pp. 241-246, 2000.
  13. Y. Chen, Z. Li, H. Jin, J. He, “Control Flow Paths Subset of Tested Program Generation Algorithm Based on LCC,” Computer Engineering, vol. 35, no. 7, pp. 39-41, 2009.
  14. M. Papadakis, N. Malevris, “Mutation based test case generation via a path selection strategy,” Information & Software Technology, vol. 54, no. 9, pp. 915-932, 2012.
  15. AUTHORS
  16. Dr. Dujan B. Taha (Assistant Prof.) is currently a lecturer at Mosul University, College of Computer Science and Mathematics / Software Engineering Department. She received B.Sc. degree in Computer Science / University of Mosul in 1991, M.Sc. degree / University of Mosul in 1996 and Ph.D. degree / University of Mosul in 2005. Her research interests are in information and network security, software engineering, image processing and pattern recognition.
  17. Abdullah H. Ahmed is currently an M.Sc. student in Software Engineering Department / Collage of Computer Science and Mathematics / University of Mosul.
Index Terms

Computer Science
Information Sciences

Keywords

Software Testing Path Testing Anti-Ant Colony Optimization Cyclomatic Complexity Control Flow Graph(CFG)

Powered by PhDFocusTM