Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers

Authors:
Mutsunori Banbara;Haruki Matsunaka;Naoyuki Tamura;Katsumi Inoue
Affiliations:
Information Science and Technology Center, Kobe University, Japan;Graduate School of System Informatics, Kobe University, Japan;Information Science and Technology Center, Kobe University, Japan;National Institute of Informatics, Japan
Venue:
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Year:
2010

Citing 23
Cited 1

On the parallel complexity of discrete relaxation in constraint satisfaction networks

Artificial Intelligence
The AETG System: An Approach to Testing Based on Combinatorial Design

IEEE Transactions on Software Engineering
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing

HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Determination of Test Configurations for Pair-Wise Interaction Coverage

TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Constructing test suites for interaction testing

Proceedings of the 25th International Conference on Software Engineering
Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing

COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Constraint Models for the Covering Test Problem

Constraints
Another look at graph coloring via propositional satisfiability

Discrete Applied Mathematics
A backtracking search tool for constructing combinatorial test suites

Journal of Systems and Software
Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach

IEEE Transactions on Software Engineering
Strength Two Covering Arrays Construction Using a SAT Representation

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Compiling finite linear CSP into SAT

Constraints
A comparison of ATMS and CSP techniques

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Upper bounds for covering arrays by tabu search

Discrete Applied Mathematics
The log-support encoding of CSP into SAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Snake lex: an alternative to double lex

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A translational approach to constraint answer set solving

Theory and Practice of Logic Programming
A new method for solving hard satisfiability problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Compiling finite linear CSP into SAT

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint-Based approaches to the covering test problem

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

Azucar: a SAT-based CSP solver using compact order encoding

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generating test cases for combinatorial testing is to find a covering array in Combinatorial Designs. In this paper, we consider the problem of finding optimal covering arrays by SAT encoding. We present two encodings suitable for modern CDCL SAT solvers. One is based on the order encoding that is efficient in the sense that unit propagation achieves the bounds consistency in CSPs. Another one is based on a combination of the order encoding and Hnich's encoding. CDCL SAT solvers have an important role in the latest SAT technology. The effective use of them is essential for enhancing efficiency. In our experiments, we found solutions that can be competitive with the previously known results for the arrays of strength two to six with small to moderate size of components and symbols. Moreover, we succeeded either in proving the optimality of known bounds or in improving known lower bounds for some arrays.