Key points are not available for this paper at this time.
One common approach to software testing, referred to as predicate testing, is to require certain types of tests for each predicate (or condition) in a program. Effective testing of predicates in a program results in effective detection of faults in the program. However, existing predicate testing strategies are ineffective or impractical for testing compound predicates, which are predicates with one or more AND/OR operators. In this paper, two fault-based testing strategies for compound predicates are defined, BOR (Boolean OperatoR) testing and BRO (Boolean and Relational Operator) testing. It is shown that for a predicate with n, nO, AND/OR operators, at most n+2 (2*n+3) tests are needed to satisfy BOR (BRO) testing. Preliminary experimental results indicate that BOR and BRO testing are effective for the detection of various types of faults in a predicate and provide more specific guidance than branch testing for test generation. 1.
Kuo‐Chung Tai (Fri,) studied this question.