This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Two Problems in the Generation of Program Test Paths
September 1976 (vol. 2 no. 3)
pp. 227-231
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.
Index Terms:
program test paths, Algorithmic complexity, constrained test paths, impossible pairs, NP-complete
Citation:
H.N. Gabow, S.N. Maheshwari, L.J. Osterweil, "On Two Problems in the Generation of Program Test Paths," IEEE Transactions on Software Engineering, vol. 2, no. 3, pp. 227-231, Sept. 1976, doi:10.1109/TSE.1976.233819
Usage of this product signifies your acceptance of the Terms of Use.