Implementation and covering analysis for the T-way combinatorial testing strategy

The paper stands from the general concepts of combinatorial testing in order to point out the benefits of the automatically generated tests based on the t-way combinatorial techniques. Then it implements an optimal strategy that reduce the necessary number of test cases and analysis its effectiveness on practical examples that involves a reduce number of correlated input parameters. Some remarks on the proposed implementations cost and test covering advantages conclude this work.

[1]  Alan Hartman,et al.  Problems and algorithms for covering arrays , 2004, Discret. Math..

[2]  Yu Lei,et al.  SP 800-142. Practical Combinatorial Testing , 2010 .

[3]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[4]  Michael L. Fredman,et al.  The AETG System: An Approach to Testing Based on Combinatiorial Design , 1997, IEEE Trans. Software Eng..

[5]  A. Jefferson Offutt,et al.  Introduction to Software Testing , 2008 .

[6]  Yu Lei,et al.  Practical Combinatorial Testing , 2010 .

[7]  Robert L. Probert,et al.  A practical strategy for testing pair-wise coverage of network interfaces , 1996, Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering.

[8]  Boris Beizer,et al.  Software Testing Techniques , 1983 .

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

[10]  D. Richard Kuhn,et al.  Pseudo-Exhaustive Testing for Software , 2006, 2006 30th Annual IEEE/NASA Software Engineering Workshop.

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

[12]  Jeff Yu Lei,et al.  IPOG: A General Strategy for T-Way Software Testing , 2007, 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07).