Optimizing IPOG's Vertical Growth with Constraints Based on Hypergraph Coloring

In this paper, we present an optimization of IPOG's vertical growth phase in the presence of constraints. The vertical growth problem is modeled as a classical NP-hard graph problem called "Minimum Vertex Coloring". In the graph model, vertices are either missing tuples that are waiting to be colored or existing tests that are already colored in different colors at the initial state, edges/hyperedges are conflicts among vertices that cannot be put in a same test. After coloring, a group of vertices in same color can be transformed to exactly a valid test. Since the original IPOG algorithm uses an arbitrary order to cover missing tuples during vertical growth, in order to reduce the number of tests, we compute the Degree of Conflicts (DOC) for each tuple, and cover the tuples in the non-increasing order of DOC. We implement a new IPOG algorithm incorporating this optimization. The experimental results show that the new IPOG algorithm reduces the number of tests for many real-life systems with constraints.

[1]  Myra B. Cohen,et al.  Evaluating improvements to a meta-heuristic search for constrained interaction testing , 2011, Empirical Software Engineering.

[2]  Steven Skiena,et al.  Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .

[3]  J. Czerwonka.  Pairwise Testing in the Real World : Practical Extensions to Test-Case Scenarios , 2011 .

[4]  Feng Duan,et al.  Improving IPOG's vertical growth based on a graph coloring scheme , 2015, 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW).

[5]  Jeff Yu Lei,et al.  IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testing , 2008, Softw. Test. Verification Reliab..

[6]  Feng Duan,et al.  Combinatorial Test Generation for Software Product Lines Using Minimum Invalid Tuples , 2014, 2014 IEEE 15th International Symposium on High-Assurance Systems Engineering.

[7]  Øystein Haugen,et al.  Properties of realistic feature models make combinatorial testing of product lines feasible , 2011, MODELS'11.

[8]  Ludek Kucera,et al.  The Greedy Coloring Is a Bad Probabilistic Algorithm , 1991, J. Algorithms.

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

[10]  Jeff Yu Lei,et al.  Applying Combinatorial Testing to the Siemens Suite , 2013, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops.

[11]  Feng Duan,et al.  Combinatorial Testing: Theory and Practice , 2015, Adv. Comput..

[12]  Angelo Gargantini,et al.  T‐wise combinatorial interaction test suites construction based on coverage inheritance , 2012, Softw. Test. Verification Reliab..

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

[14]  Sylvain Hallé,et al.  Graph Methods for Generating Test Cases with Universal and Existential Constraints , 2015, ICTSS.

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

[16]  Jeff Yu Lei,et al.  ACTS: A Combinatorial Test Generation Tool , 2013, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation.

[17]  Myra B. Cohen,et al.  An Improved Meta-heuristic Search for Constrained Interaction Testing , 2009, 2009 1st International Symposium on Search Based Software Engineering.

[18]  David W. Matula,et al.  GRAPH COLORING ALGORITHMS , 1972 .

[19]  Feng Duan,et al.  Constraint handling in combinatorial test generation using forbidden tuples , 2015, 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW).

[20]  Jeff Yu Lei,et al.  An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation , 2013, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation.

[21]  Myra B. Cohen,et al.  Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach , 2008, IEEE Transactions on Software Engineering.

[22]  Claude Berge,et al.  Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.