Abstract
Software Testing is one of the most important parts of the software development lifecycle. Testing effectiveness can be achieved by the State Transition Testing (STT) and path testing which is commonly used for carrying out functional and structural testing of software systems. The tester is required to test all possible transitions and paths in the system under built. Aim of the current paper is to present an algorithm for generation of test sequences for state transitions of the system as well as path generation for CFG of the software code using the basic property and behavior of the ants. This novel approach tries to find out all the effective (or can say optimal) paths and test sequences by applying ant colony optimization (ACO) principle using some set of rules. This algorithm tries to give maximum software coverage with minimal redundancy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
