Evaluation of a predicate-based software testing strategy
IBM Systems Journal
Predicate-based test generation for computer programs
ICSE '93 Proceedings of the 15th international conference on Software Engineering
Automatically Generating Test Data from a Boolean Specification
IEEE Transactions on Software Engineering
On the experience of using cause-effect graphs for software specification and test generation
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Sensitive test data for logic expressions
ACM SIGSOFT Software Engineering Notes
Detecting associative shift faults in predicate testing
Journal of Systems and Software
| Hi-index | 0.00 |
In this paper [1] , we propose a new solution for generating test cases for Boolean expressions. In the past, we have reported algorithm BOR for generating test cases for predicates which are singular; that is, predicates that contain only one occurrence of the constituent Boolean variables. We also reported results of the empirical studies that were carried out on the effectiveness of the strategy. But the BOR algorithm did not work well with nonsingularities - expressions containing multiple occurrences of constituent Boolean variables. The solution we propose for the problem is a combination of the original BOR strategy and the meaning impact strategy reported by Weyuker et.al. The approach consists of isolating the minimal nonsingular component of the input predicate, applying meaning impact strategy to that component, and applying the BOR strategy to the singular component. We have implemented this algorithm and gathered the results of our experiments. These results indicate that there is substantial reduction in the number of test cases required using this method rather than using only the meaning impact strategy.