ACM Home Page
Please provide us with feedback. Feedback
Reducing the effects of infeasible paths in branch testing
Full text PdfPdf (678 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: 48 - 54  
Year of Publication: 1989
ISBN:0-89791-342-6
Also published in ...
Authors
D. Yates  Department of Computer Science, University of Liverpool, UK
N. Malevris  Department of Computer Science, University of Liverpool, UK
Sponsors
IEEE-CS : Computer Society
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 37,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/75308.75315
What is a DOI?

ABSTRACT

Branch testing, which is one of the most widely used methods for program testing, see White [1] for example, involves executing a selected set of program paths in an attempt to exercise all program branches. Criteria for selecting such paths have, to date, received scant attention in the literature and it is the issue of developing a suitable path selection strategy to which this paper is addressed. Specifically, a selection strategy, which aims at reducing the number of infeasible paths generated during the branch testing exercise is proposed. The strategy is founded on an assertion concerning the likely feasibility of program paths. Statistical evidence in support of the assertion is provided, a method implementing the strategy is described, and the results obtained from applying the method to a set of program units are reported and analysed.


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.

 
1
White, L. J. "Software Testing and Verification", Advances in Computers, M. C. Yovits cd., 26, 1987.
 
2
Howden W. E. "Empirical Studies of Software Validation", Tutorial: Software Testing and Validation Techniques, E. Miller and W. E. Howden eds., IEEE, 1978.
 
3
Yates, D. F. and Hennell M. A. "An Approach to Branch Testing" Proc 11th International Workshop on Graph Theoretic Techniques in Computer Science, Wurtzburg, 1985.
 
4
Chatfield, C. " Statistics for Technology ", Chapman and Hall, New York, 1970.
 
5
Weyuker, E. J. "The Applicability of Program Schema Results to Programs", Int. J. Comput. Inf. Sci., 8, 1979.
 
6
Brown, J. R. "Practical Application of Automated Software Tools", TRW Report TRW-SS-72-05, TRW Systems, One Space Park, Redondo Beach, California, 1972.
 
7
Malevris N. Ph.D. thesis, University of Liverpool, U.K., 1988.
 
8
Dreyfus S. E. "An Appraisal of Some Shortest-Path Algorithms", Operations Research, 17, 1969.
 
9
Shier D. R. "Iterative Methods for Determining the K Shortest Paths in a Network", Networks, 6, 1976.
10

CITED BY  14