Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Software Engineering: A Practitioner's Approach
Software Engineering: A Practitioner's Approach
The State-Based Testing of Object-Oriented Programs
ICSM '93 Proceedings of the Conference on Software Maintenance
The Art of Software Testing
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Automatic Test Data Generation Based on Ant Colony Optimization
ICNC '09 Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 06
Application of genetic algorithm and tabu search in software testing
COMPUTE '11 Proceedings of the Fourth Annual ACM Bangalore Conference
| Hi-index | 0.00 |
The present work describes a method for increasing software testing efficiency by identifying the optimal test sequences in the state machine diagram. The method employs a Meta-heuristic algorithm called Cuckoo Search to investigate best paths in the diagram. It tries to provide a technique for exhaustive coverage with minimal repetition which ensures all transitions coverage and all paths coverage at least once with minimal number of repetitions of states as well as transitions. The algorithm works by maximising an objective function which focuses on most error prone parts of the program so that critical portions can be tested first. State machine diagram is given as input, and Cuckoo Search is performed to generate a list of test sequences as output.