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.
[1]
Edward Minieka,et al.
On computing sets of shortest paths in a graph
,
1974,
Commun. ACM.
[2]
Stuart E. Dreyfus,et al.
An Appraisal of Some Shortest-Path Algorithms
,
1969,
Oper. Res..
[3]
Douglas R. Shier,et al.
Iterative methods for determining the k shortest paths in a network
,
1976,
Networks.
[4]
William E. Howden,et al.
Empirical studies of software validation
,
1979
.
[5]
Michael J. Maher,et al.
Statistics for Technology.
,
1979
.
[6]
Lee J. White.
Software Testing and Verification
,
1987,
Adv. Comput..