The Path Dividing Technique of Software Testing
Gong Yun-zha · 2002
A path coverage criterion is satisfied by certain sets of paths through a program, which is better than other criteria. But for ordinary programs, testing all the paths is usually impossible because they often contain infinite paths. Path dividing is a compromise method in path coverage testing technique. In this paper, proposes a dividing algorithm for a given program P and maximum paths number k in a modular, and also gives the optimum dividing method.