| Estimating the number of test cases required to satisfy the all-du-paths testing criterion |
| Full text |
Pdf
(789 KB)
|
| Source
|
International Symposium on Software Testing and Analysis
archive
Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
table of contents
Key West, Florida, United States
Pages: 179 - 186
Year of Publication: 1989
ISBN:0-89791-342-6
Also published in ...
|
|
Authors
|
|
J. Bieman
|
Department of Computer Science, Colorado State University, Fort Collins, CO
|
|
J. Schultz
|
Department of Statistics, Iowa State University, Ames, IA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 37, Citation Count: 2
|
|
|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
BBC87
|
A. Baker, J. Bieman, and P. Clites. Implications for formal specifications - results of specifying a software engineering tool. Proc. IEEE Computer Society's Eleventh Annual International Computer Software & Applications Conference (COMPSA C87), 131-140, October 1987. Tokyo, Japan.
|
| |
BBC*88
|
|
| |
BHB86
|
Albert L. Baker, James W. Howatt, and James M. Bieman. Criteria for finite sets of paths that characterize control flow. Proc. 19th Hawaii International Conference on System Sciences (HICSS-19) IIA:158-163, January 1986.
|
| |
CPRZ85
|
Lori A. Clarke , Andy Podgurski , Debra J. Richardson , Steven J. Zeil, A comparison of data flow path selection criteria, Proceedings of the 8th international conference on Software engineering, p.244-251, August 28-30, 1985, London, England
|
| |
DBB86
|
K. Doh, J. Bieman, and A. Baker. Generating a Standard Representation from Pascal Programs. Technical Report TR 86-15, Dept. of Computer Science, Iowa State University, Ames, Iowa, 1986.
|
| |
FW85
|
Phyllis G. Frankl , Elaine J. Weyuker, A data flow testing tool, Proceedings of the second conference on Software development tools, techniques, and alternatives, p.46-53, December 1985, San Francisco, California, United States
|
| |
FW88
|
|
| |
FWW85
|
P. G. Frankl, S. N. Weiss, and E. J. Weyuker. Asset: a system to select and evaluate tests. Proc. IEEE Conference on Software Tools, 72- 79, April 1985.
|
| |
Hay87
|
|
| |
Hec77
|
|
| |
Jon86
|
|
| |
JW85
|
|
| |
KP78
|
|
| |
Nta88
|
|
| |
RW85
|
|
| |
Sch88
|
J. L. Schultz. Measuring the Cardinality of Execution Path Subsets Meeting the All-DU-Paths Testing Criterion. Master's project, Department of Computer Science, Iowa State University, Ames, IA, 1988.
|
| |
Wey84
|
|
| |
WGM85
|
M. D. Weiser, J. D. Gannon, and P. R. McMullin. Comparison of structured test coverage metrics. IEEE Software, 2(2):80-85, March 1985.
|
CITED BY 2
|
|
J. R. Horgan , S. London, Data flow coverage and the C language, Proceedings of the symposium on Testing, analysis, and verification, p.87-97, October 08-10, 1991, Victoria, British Columbia, Canada
|
|
|
|
|