On computing sets of shortest paths in a graph
Communications of the ACM
Applications of feasible path analysis to program testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
A meaningful bound for branch testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs
IEEE Transactions on Software Engineering
Unconstrained duals and their use in achieving all-uses coverage
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Towards a structural load testing tool
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Feasible test path selection by principal slicing
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Automatic test data generation using constraint solving techniques
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
An applicable test data generation algorithm for domain errors
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Symbolic Execution of Program Paths Involving Pointer and Structure Variables
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
On structurally testing Java programs effectively
Proceedings of the 3rd international symposium on Principles and practice of programming in Java
Proceedings of the 1st international workshop on Random testing
System Test Planning of Software: An Optimization Approach
IEEE Transactions on Software Engineering
An objective comparison of the cost effectiveness of three testing methods
Information and Software Technology
Detecting large number of infeasible paths through recognizing their patterns
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Heuristics-based infeasible path detection for dynamic test data generation
Information and Software Technology
Towards automating the generation of mutation tests
Proceedings of the 5th Workshop on Automation of Software Test
Enhancing structural software coverage by incrementally computing branch executability
Software Quality Control
A theory of predicate-complete test coverage and generation
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Mutation based test case generation via a path selection strategy
Information and Software Technology
| Hi-index | 0.00 |
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.