CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 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

An Efficient Technique for Software Coverage using Metaheuristic Algorithm

Published on June 2012 by Nupur Bajaj, Meha Khera, Vikram, Vijay Chahar
journal_cover_thumbnail

National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011
Foundation of Computer Science USA
RTMC - Number 14
June 2012
Authors: Nupur Bajaj, Meha Khera, Vikram, Vijay Chahar
ab477718-adee-48c1-a8ec-b050a79677a7

Nupur Bajaj, Meha Khera, Vikram, Vijay Chahar . An Efficient Technique for Software Coverage using Metaheuristic Algorithm. National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011. RTMC, 14 (June 2012), 29-31.

@article{
author = { Nupur Bajaj, Meha Khera, Vikram, Vijay Chahar },
title = { An Efficient Technique for Software Coverage using Metaheuristic Algorithm },
journal = { National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011 },
issue_date = { June 2012 },
volume = { RTMC },
number = { 14 },
month = { June },
year = { 2012 },
issn = 0975-8887,
pages = { 29-31 },
numpages = 3,
url = { /proceedings/rtmc/number14/7139-1116/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011
%A Nupur Bajaj
%A Meha Khera
%A Vikram
%A Vijay Chahar
%T An Efficient Technique for Software Coverage using Metaheuristic Algorithm
%J National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011
%@ 0975-8887
%V RTMC
%N 14
%P 29-31
%D 2012
%I International Journal of Computer Applications
Abstract

Software Testing is one of the most important parts of the software development lifecycle. Functional and structural testing are the most widely used testing methods to test software. Testing effectiveness can be achieved by the State Transition Testing (STT) which is commonly used for carrying out functional testing of software systems. The tester is required to test all the possible transitions in the system under built. Structural testing relies on identifying effective paths of the code. Aim of the current paper is to present a strategy by applying ant colony optimization technique, for the generation of test sequences for state transitions of the system as well as path generation for the Control Flow Graph of the software code using the basic property and behavior of the ants. This Proposed strategy gives maximum software coverage with minimal redundancy.

References
  1. Ian Sommerville," Software Engineering", eight Edition, Pearson Edition, 2009.
  2. Aditya P. Mathur "Foundation of Software Testing", First Edition, Pearson Education, 2007.
  3. Myers, G. , The Art of Software Testing. 2 edition: John Wiley & Son. Inc. 234 pages, 2004.
  4. Marco Dorigoa and Thomas Stutzle, "Ant colony optimization, The Knowledge Engineering Review", Cambridge University Press New York, NY, USA. , Volume 20, Pp: 92 – 93,2005.
  5. DI´AZ E. , TUYA J. , BLANCO R. : 'Automated software testing using a meta-heuristic technique based on tabu search'. ASE-2003.
  6. Marco Dorigo and Thomas Stutzle, "Ant Colony Optimization", phi publishers, 2005.
  7. S. D. Shtovba,"AntAlgorithms: Theory and Applications",programming and computing software,vol 31,issue 4,pp167-178, 2005.
  8. Praveen Ranjan Srivastava, K M Baby, "An Approach of Optimal Path Generation using Ant Colony Optimization", ISBN-978-1-4244-4546-2, pages 1-6, IEEE-TENCON, Singapore, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Software Testing Ant Colony Optimization (aco) State Transition Testing (stt) Control Flow Graph (cfg)