Condition-based software testing strategies

Abstract

The author defines two condition testing strategies, BRO (Boolean and relational operator) and BRE (Boolean and relational expression) testing. These two testing strategies are different from existing condition testing strategies in that they are based on the detection of both Boolean and relational expression errors in a condition. For a condition with n operands, the number of tests required by BRO or BRE testing is at most 2(n+1). Based on empirical studies of the algorithms SBEMIN and SBEMINSEN and the theoretical properties of BRO and BRE testing, it is believed that BRO and BRE testing is practical and effective for testing programs containing complicated conditions.<>