This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Experience with Path Analysis and Testing of Programs
May 1980 (vol. 6 no. 3)
pp. 278-286
M.R. Woodward, Department of Computational and Statistical Science, University of Uverpool
There are a number of practical difficulties in performing a path testing strategy for computer programs. One problem is in deciding which paths, out of a possible infinity, to use as test cases. A hierarchy of structural test metrics is suggested to direct the choide and to monitor the coverge of test paths. Another problem is that many of the chosen paths may be infeasible in the sense that no test data can ever execute them. Experience with the use of "allegations" to circumvent this problem and prevent the static generation of many infeasible paths is reported.
Index Terms:
test metrics, Alegations, infeasible paths, path testing
Citation:
M.R. Woodward, D. Hedley, M.A. Hennell, "Experience with Path Analysis and Testing of Programs," IEEE Transactions on Software Engineering, vol. 6, no. 3, pp. 278-286, May 1980, doi:10.1109/TSE.1980.230473
Usage of this product signifies your acceptance of the Terms of Use.