Evaluation of Fault Detection Effectiveness for Combinatorial and Exhaustive Selection of Discretized Test Inputs

This article compares the effectiveness of combinatorial test methods with exhaustive testing of discretized inputs for the document object model events standard.

[1]  D. Richard Kuhn,et al.  Software fault interactions and implications for software testing , 2004, IEEE Transactions on Software Engineering.

[2]  M. J. Reilly,et al.  An investigation of the applicability of design of experiments to software testing , 2002, 27th Annual NASA Goddard/IEEE Software Engineering Workshop, 2002. Proceedings..

[3]  Yu Lei,et al.  In-parameter-order: a test generation strategy for pairwise testing , 1998, Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231).

[4]  Yu Lei,et al.  A Test Generation Strategy for Pairwise Testing , 2002, IEEE Trans. Software Eng..

[5]  A. Jefferson Offutt,et al.  Combination testing strategies: a survey , 2005, Softw. Test. Verification Reliab..

[6]  Paul C. Jorgensen,et al.  Software Testing: A Craftsman's Approach , 1995 .

[7]  Mladen A. Vouk,et al.  Optimizing effectiveness and efficiency of software testing: a hybrid approach , 2006 .

[8]  Jeff Yu Lei,et al.  Combinatorial Software Testing , 2009, Computer.

[9]  Luciano Baresi,et al.  An Introduction to Software Testing , 2006, FoVMT.

[10]  Myra B. Cohen,et al.  Testing across configurations: implications for combinatorial testing , 2006, SOEN.

[11]  Patrick J. Schroeder,et al.  Pairwise Testing : A Best Practice That Isn ’ , 2005 .