An Efficient Optimization Algorithm for Structural Software Testing

Structural testing is most important and high demand testing technique for code-based criteria in software testing. In structural testing, path testing technique is the most useful technique. In path testing, generation of all independent paths (non redundant) is a complex one. The aim of this paper is to present a simple and efficient algorithm that can automatically generate all possible paths in a Control Flow Graph for Path testing. Cuckoo behaviour is used in this algorithm for extracting optimal paths. This cuckoo search algorithm generates paths equal to the cyclomatic complexity. It can be shown that the proposed approach guarantees full path coverage.