Identification of critical test paths using firefly algorithm for object oriented software

Abstract

Software testing is a cost-effective process, hence every-time it is not practically feasible to test all the test paths of the entire software application. In this paper, we propose a technique which helps in optimizing the process of software testing. The proposed technique identifies those test paths which are more crucial and fault-prone and ranked them accordingly. In this paper, firefly algorithm is used for the determination of critical test paths. The proposed algorithm generates a random factor to capture the motion of fireflies, when no brighter firefly is present in the search space. The proposed algorithm has been applied on five case studies of object-oriented applications. First the test paths are created for these case studies and then the criticality of generated test paths is calculated using firefly algorithm. Results indicate that those test paths which contain predicate nodes and recursive nodes are more critical i.e. they are more error prone and need to be tested first. Using the proposed technique, critical paths are recognized and arranged in the order of their criticality which further increases the testing effectiveness.

Subject Classification:

• 68N30

Keywords:

• Firefly Algorithm
• Meta-heuristic
• Optimization
• Test Case Prioritization
• State Machine Diagram