As. Parrish et Sh. Zweben, ON THE RELATIONSHIPS AMONG THE ALL-USES, ALL-DU-PATHS, AND ALL-EDGES TESTING CRITERIA, IEEE transactions on software engineering, 21(12), 1995, pp. 1006-1009
The all-du-paths data flow testing criterion was designed to be more d
emanding than the all-uses criterion, which itself was designed to be
more demanding than the all-edges criterion. However, formal compariso
n metrics developed within the testing community have failed to valida
te these relationships, without requiring restrictive or undecidable a
ssumptions regarding the universe of programs to which the criteria ap
ply. In this correspondence, we show that the formal relationships amo
ng these criteria can be made consistent with their intended relative
strengths, without making restrictive or undecidable assumptions.