This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nontraversible Paths in a Program
June 1987 (vol. 13 no. 6)
pp. 751-756
M. Chellappa, Flight Control Systems Division, Aeronautical Development Establishment
A finite-state machine representation of a program graph is shown to have the property of exposing nontraversible paths in a program. A minimal covering set of paths for such a program may fail to yield realizable test cases, as the nontraversible paths have inconsistent path predicates.
Index Terms:
test cover, Directed graph, finite state machine, path analysis, path predicates, test case selection
Citation:
M. Chellappa, "Nontraversible Paths in a Program," IEEE Transactions on Software Engineering, vol. 13, no. 6, pp. 751-756, June 1987, doi:10.1109/TSE.1987.233480
Usage of this product signifies your acceptance of the Terms of Use.