An experimental comparison of the effectiveness of the all-uses and all-edges adequacy criteria
Authors:
Open Access
- 1 October 1991
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 154-164
Abstract
An experimental comparison of the effectiveness of the all-uses and all-edges test data adequacy criteria was performed. A large number of test sets was randomly generated for each of nine subject programs with sub- tle errors. For each test set, the percentages of (exe- cutable) edges and definition-use associations covered were measured and it was determined whether the test set exposed an error. Hypothesis testing was used to investigate whether all-uses adequate test sets are more likely to expose errors than are all-edges adequate test sets. All-uses was shown to be significantly more effec- tive than all-edges for five of the subjects; moreover, for four of these, all-uses appeared to guarantee detection of the error. Further analysis showed that in four subjects, all-uses adequate test sets appeared to be more effective than all-edges adequate test sets of the same size. Lo- gistic regression showed that in some, but not all of the subjects there was a strong positive correlation between the percentage of definition-use associations covered by a test set and its error-exposing ability.Keywords
This publication has 23 references indexed in Scilit:
- Partition testing does not inspire confidence (program testing)IEEE Transactions on Software Engineering, 1990
- A formal evaluation of data flow path selection criteriaIEEE Transactions on Software Engineering, 1989
- Some observations on partition testing1989
- Theoretical comparison of testing methods1989
- A comparison of some structural testing strategiesIEEE Transactions on Software Engineering, 1988
- Numerical recipes: the art of scientific computingAnalytica Chimica Acta, 1987
- Remark on algorithm 408ACM Transactions on Mathematical Software, 1978
- An Approach to Program TestingACM Computing Surveys, 1975
- SELECT---a formal system for testing and debugging programs by symbolic execution1975
- Algorithm 408: a sparse matrix package (part I) [F4]Communications of the ACM, 1971