Estimating the number of test cases required to satisfy the all-du-paths testing criterion
Authors: 
J. Bieman, J. SchultzAuthors Info & Claims
J. Bieman, J. SchultzAuthors Info & ClaimsPages 179 - 186
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
[1]
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.
[2]
J. Bieman, A. Baker, P. Clites, D. Gustafson, and A. Melton. A standard representation of imperative language programs for data collection and software measures specification. The Journal of Systems and Software, 8(1):13-37, January 1988.
[3]
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.
[4]
L. A. Clarke, A. Podgurski, D. J. Richardson, and S. J. Zeil. A comparison of data flow path selection criteria. Proc. 8th International Conference on Software Engineering, 244-251, 1985.
[5]
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.
[6]
P. G. Frank1 and E. J. Weyuker. A data flow testing tool. Proc. Softfair 11, December 1985.
[7]
P. G. Frank1 and E. J. Weyuker. An applicable family of data flow testing criteria. IEEE Trans. Software Engineering, 14(10):1483-1498, 1988.
[8]
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.
[9]
I. Hayes (editor). Specification Case Studies. Prentice-Hall International, London, 1987.
[10]
M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, New York, 1977.
[11]
C.B. Jones. Systematic Software Development Using VDM. Prentice-Hall International, London, 1986.
[12]
K. Jensen and N. Wirth. Pascal User Manual and Report, Third Edition. Springer-Verlag, New York, 3rd edition, 1985.
[13]
B. W. Kernighan and P. J. Plauger. The Elements of Programming Style, 2nd Ed. McGraw- Hill, New York, 1978.
[14]
S. C. Ntafos. A comparison of some structural testing strategies. IEEE Trans. Software Engineering, 14(6):868-874, June 1988.
[15]
S. Rapps and E. J. Weyuker. Selecting software test data using data flow information. IEEE Trans. Software Engineering, SE-11(4):367-375, April 1985.
[16]
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.
[17]
E. J. Weyuker. The complexity of data flow criteria for test data selection. Information Processing Letters, 19:103-109, August 1984.
[18]
M. D. Weiser, J. D. Gannon, and P. R. McMullin. Comparison of structured test coverage metrics. IEEE Software, 2(2):80-85, March 1985.
Index Terms
- Estimating the number of test cases required to satisfy the all-du-paths testing criterion
Recommendations
Estimating the number of test cases required to satisfy the all-du-paths testing criterion
TAV3: Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verificationThe 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 ...
Constructing test cases for n-wise testing from tree-based test models
SoICT '13: Proceedings of the 4th Symposium on Information and Communication TechnologyIn our previous work [17], we proposed a model-based combinatorial testing method, called FOT. It provides a technique to design test-models for combinatorial testing based on extended logic trees. In this paper, we introduce pair-wise testing (and by ...
Enhancing Test Cases generated by Concolic Testing
ISEC '19: Proceedings of the 12th Innovations in Software Engineering Conference (formerly known as India Software Engineering Conference)Concolic testing tools can automatically generate test cases. However, there is a scope to increase the coverage achieved. Pair-wise testing is a prominent black-box testing method. We propose to combine ideas from these two techniques to enhance the ...
Comments
Information & Contributors
Information
Published In
Copyright © 1989 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 November 1989
Published in SIGSOFT Volume 14, Issue 8
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations12Total Citations
- 629Total Downloads
- Downloads (Last 12 months)73
- Downloads (Last 6 weeks)13
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in