ACM SIGSOFT Software Engineering Notes · 1989 · 15 citations · 7 references
ComputingComputer ScienceProgramming LanguagesSoftware EngineeringTest ConstructionControl-flow AnalysisData-flow AnalysisSoftware TestingCode Path AnalysisSoftware TestabilitySoftware Testing ProcessTest Cases
The all-du-paths software testing criterion is the most discriminating of the data flow testing criteria of Rapps and Weyuker. Unfortunately, in the worst case, the criterion requires an exponential number of test cases. To investigate the practicality of the criterion, we develop tools to count the number of complete program paths necessary to satisfy the criterion. This count is an estimate of the number of test cases required. In a case study of an industrial software system, we find that in eighty percent of the subroutines the all-du-paths criterion is satisfied by testing ten or fewer complete paths. Only one subroutine out of 143 requires an exponential number of test cases.
7
A comparison of data flow path selection criteria
Lori A. Clarke, Andy Podgurski, Debra J. Richardson et al. · 1985 · 80 citations