A finite domain-testing strategy for computer program testing.
A finite domain-testing strategy for computer program testing.
Experiments determining best paths for testing computer program predicates
ICSE '85 Proceedings of the 8th international conference on Software engineering
The application of error-sensitive testing strategies to debugging
SIGSOFT '83 Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging
The evolution of an integrated testing environment by the Domain Testing Strategy
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Algebraic Software Testing in Vector Spaces of Functions
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
| Hi-index | 0.00 |
Many testing methods require the selection of a set of paths over which testing is to be conducted. This paper presents an analysis of the effectiveness of individual paths for testing predicates in linearly domained programs. A measure is derived for the marginal advantage of testing another path after several paths have already been tested. This measure is used to show that any predicate in such programs may be sufficiently tested using at most m+n+1 paths, where m is the number of input values and n is the number of program variables.