Test case selection strategies based on Boolean specifications ‡

This paper considers test case selection for programs whose specifications are expressed by Boolean algebra. The approach is to select test cases based on Boolean specifications. Three test case selection strategies are proposed that aim at the detection of the literal insertion fault and the literal reference fault. Although the MAX‐B strategy proposed by Weyuker et al. guarantees detection of these types of faults, the proposed strategies are more effective in the sense that the derived test cases form a subset of those selected by the MAX‐B strategy. Copyright © 2001 John Wiley & Sons, Ltd.

[1]  Tsong Yueh Chen,et al.  An empirical study on the effectiveness of the greedy MUTP strategy , 1998, Proceedings. 1998 International Conference Software Engineering: Education and Practice (Cat. No.98EX220).

[2]  Kuo-Chung Tai,et al.  Test generation for Boolean expressions , 1995, Proceedings of Sixth International Symposium on Software Reliability Engineering. ISSRE'95.

[3]  Elaine J. Weyuker,et al.  Automatically Generating Test Data from a Boolean Specification , 1994, IEEE Trans. Software Eng..

[4]  K. A. Foster,et al.  Sensitive test data for logic expressions , 1984, SOEN.

[5]  Donald D. Givone,et al.  Introduction to switching circuit theory , 1970 .

[6]  K.-C. Tai.  Condition-based software testing strategies , 1990, Proceedings., Fourteenth Annual International Computer Software and Applications Conference.

[7]  Steven P. Miller,et al.  Applicability of modified condition/decision coverage to software testing , 1994, Softw. Eng. J..

[8]  M. F. Lau,et al.  On the effectiveness of greedy CUTPNFP strategy for Boolean specification based testing: an empirical evaluation , 2000 .

[9]  Kuo-Chung Tai,et al.  Theory of Fault-Based Predicate Testing for Computer Programs , 1996, IEEE Trans. Software Eng..

[10]  Tsong Yueh Chen,et al.  Two test data selection strategies towards testing of Boolean specifications , 1997, Proceedings Twenty-First Annual International Computer Software and Applications Conference (COMPSAC'97).

[11]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .