Abstract: In order to generate test data for a given branch, a new program flow graph is constructed, and Fibonacci method is used to optimize the path selection. The conception and calculation to path-based test data generation complexity is presented. If all bran

Key words: Branch coverage,Predicate function,I,inear arithmetic representation