An empirical study on the effectiveness of the greedy MUTP strategy

We propose the use of a greedy heuristic in finding a subset of test cases from the set of all unique true points so that it satisfies the multiple unique true points (or MUTP) strategy. Moreover we report an empirical study on the effectiveness of the greedy heuristic in finding a set of test cases that satisfies the MUTP strategy.

[1]  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).

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

[3]  Tsong Yueh Chen,et al.  Dividing Strategies for the Optimization of a Test Suite , 1996, Inf. Process. Lett..

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

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

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

[7]  Nancy G. Leveson,et al.  Requirements Specification for Process-Control Systems , 1994, IEEE Trans. Software Eng..

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

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

[10]  Hareton K. N. Leung,et al.  Insights into regression testing (software testing) , 1989, Proceedings. Conference on Software Maintenance - 1989.

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