Issue No. 03 - September (1976 vol. 2)
H.N. Gabow , Department of Computer Science, University of Colorado
In this paper we analyze the complexity of algorithms for two problems that arise in automatic test path generation for programs: the problem of building a path through a specified set of program statements and the problem of building a path which satisfies impossible-pairs restrictions on statement pairs. These problems are both reduced to graph traversal problems. We give an efficient algorithm for the first, and show that the second is NP-complete.
program test paths, Algorithmic complexity, constrained test paths, impossible pairs, NP-complete
H. Gabow, S. Maheshwari and L. Osterweil, "On Two Problems in the Generation of Program Test Paths," in IEEE Transactions on Software Engineering, vol. 2, no. , pp. 227-231, 1976.