Finding Most Feasible Path in Weighted Control Flow Graph of a C Program for Testing Optimization

Abstract

An effective testing can reduce the cost and time considerably. In this study our aim is to design a
software tool that will compute the most feasible path for all programs in C language. Finding of most
feasible path requires a construction of weighted control flow graph, which helps in determining the
frequency of all paths in control flow graph and finally most frequent path(as the weight decides the
frequency) is termed as most feasible path. Concept of most feasible path makes the test data generation
easy and in optimized manner and also act as an effective tool for efficient testing of entire software.