A generalized optimal path-selection model for structural program testing

Abstract

Economic and effective preparation of test cases involves identification of the minimal set of test paths that meets certain test requirements. Unlike traditional approaches that employ heuristic algorithms, we solve this problem on the basis of a rigid mathematical ground. This article discusses how the path-selection problem in structural program testing can be formulated as a zero-one integer programming problem. It is thus possible to find the solution through one of the most powerful problem-solving techniques in the realm of operations research. The model applies not only to common requirements such as statement and branch testing. This generalized model has greater merits. A large variety of constraints, cost functions, and coverage requirements can easily be handled as special cases of the same integer programming problem.