Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion

@inproceedings{Bieman1989EstimatingTN,
  title={Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion},
  author={James M. Bieman and Janet L. Schultz},
  booktitle={Symposium on Testing, Analysis, and Verification},
  year={1989}
}
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… CONTINUE READING