This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Relationships Among the All-Uses, All-DU-Paths, and All-Edges Testing Criteria
December 1995 (vol. 21 no. 12)
pp. 1006-1009
The all-du-paths data flow testing criterion was designed to be more demanding than the all-uses criterion, which itself was designed to be more demanding than the all-edges criterion. However, formal comparison metrics developed within the testing community have failed to validate these relationships, without requiring restrictive or undecidable assumptions regarding the universe of programs to which the criteria apply. In this correspondence, we show that the formal relationships among these criteria can be made consistent with their intended relative strengths, without making restrictive or undecidable assumptions.

[1] R. Borie,A. Parrish,, and S. Mandyam,“Lock-and-key strategies for handlinguninitialized variables,” Software—Practice and Experience, vol. 23, no. 7, pp. 693-710, July 1993.
[2] L.D. Fosdick and L.J. Osterweil,“Data flow analysis in softwarereliability,” ACM Computing Surveys, vol. 8, pp. 305-330, Sept. 1976.
[3] P. Frankl and E.J. Weyuker, “An Applicable Family of Data Flow Testing Criteria,” IEEE Trans. Software Eng., vol. 14, no. 10, pp. 1,483–1,498, Oct. 1988.
[4] P.G. Frankl and E.J. Weyuker,“A formal analysis of the fault-detecting ability of testing methods,” IEEE Transactions on Software Engineering, vol. 19, no. 3, Mar. 1993, pp. 202-213,
[5] P.G. Frankl and E.J. Weyuker,“Provable improvements on branch testing,” IEEE Transactions on Software Engineering, vol. 19, no. 10, Oct. 1993, pp. 962-975.
[6] D.E. Harms and B.W. Weide, "Copying and Swapping: Influences on the Design of Reusable Software Components," IEEE Trans. Software Eng., vol. 17, no. 5, pp. 424-435, May 1991.
[7] J.R. Horgan and S.A. London,“Dataflow coverage and the C language,” Proc. Fourth Symp. on Software Testing, Analysis and Verification,Victoria, British Columbia, Canada, Oct. 1991, pp. 87-97.
[8] W. Kempton and B. Wichmann,“Run-time detection of undefined variablesconsidered essential,” Software—Practice and Experience, vol. 20, no. 4, pp. 391-402, Apr. 1990.
[9] B. Meyer, Introduction to the Theory of Programming Languages, Prentice Hall, Hemel Hempstead, U.K., 1990.
[10] J.W. Laski and B. Korel,“A data flow oriented program testing strategy,” IEEE Trans. Software Engineering, vol. 9, no. 5, pp. 347-354, May, 1983.
[11] B. Weide, W. Ogden, and S. Zweben, "Reusable Software Components," M. Yovits, ed., Advances in Computers, vol. 33, pp. 1-65. Academic Press, 1991.

Index Terms:
Adequacy criteria, data flow testing, subsumes, covers.
Citation:
Allen S. Parrish, Stuart H. Zweben, "On the Relationships Among the All-Uses, All-DU-Paths, and All-Edges Testing Criteria," IEEE Transactions on Software Engineering, vol. 21, no. 12, pp. 1006-1009, Dec. 1995, doi:10.1109/32.489075
Usage of this product signifies your acceptance of the Terms of Use.