Constraint Models for the Covering Test Problem

Authors:
Brahim Hnich;Steven D. Prestwich;Evgeny Selensky;Barbara M. Smith
Affiliations:
Faculty of Computer Science, Izmir University of Economics, Izmir, Turkey;Cork Constraint Computation Centre, University College, Cork, Ireland;Vidus Limited, Ipswich, UK;Cork Constraint Computation Centre, University College, Cork, Ireland
Venue:
Constraints
Year:
2006

Citing 18
Cited 26

Tree clustering for constraint networks (research note)

Artificial Intelligence
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The AETG System: An Approach to Testing Based on Combinatorial Design

IEEE Transactions on Software Engineering
On the conversion between non-binary constraint satisfaction problems

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
The Combinatorial Design Approach to Automatic Test Generation

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

HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
Global Constraints for Lexicographic Orderings

CP '02 Proceedings of the 8th 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
A Dual Graph Translation of a Problem in 'Life'

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
Upper bounds for covering arrays by tabu search

Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
A framework of greedy methods for constructing interaction test suites

Proceedings of the 27th international conference on Software engineering
GSAT and local consistency

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Adding new clauses for faster local search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Constraint-Based approaches to the covering test problem

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

Interaction testing of highly-configurable systems in the presence of constraints

Proceedings of the 2007 international symposium on Software testing and analysis
A backtracking search tool for constructing combinatorial test suites

Journal of Systems and Software
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
Merging covering arrays and compressing multiple sequence alignments

Discrete Applied Mathematics
Binary Covering Arrays and Existentially Closed Graphs

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing

TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Interaction Coverage Meets Path Coverage by SMT Constraint Solving

TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Covering and radius-covering arrays: Constructions and classification

Discrete Applied Mathematics
A logic-based approach to combinatorial testing with constraints

TAP'08 Proceedings of the 2nd international conference on Tests and proofs
A survey of combinatorial testing

ACM Computing Surveys (CSUR)
On the complexity and completeness of static constraints for breaking row and column symmetry

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A Formal Logic Approach to Constrained Combinatorial Testing

Journal of Automated Reasoning
MiTS: a new approach of tabu search for constructing mixed covering arrays

MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Construction of mixed covering arrays of variable strength using a tabu search approach

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Design and implementation of a t-way test data generation strategy with automated execution tool support

Information Sciences: an International Journal
Evaluating improvements to a meta-heuristic search for constrained interaction testing

Empirical Software Engineering
The Minimal Failure-Causing Schema of Combinatorial Testing

ACM Transactions on Software Engineering and Methodology (TOSEM)
An exact approach to maximize the number of wild cards in a covering array

MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Partial symmetry breaking by local search in the group

Constraints
Symmetry breaking via LexLeader feasibility checkers

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Randomized post-optimization of covering arrays

European Journal of Combinatorics
Increasing symmetry breaking by preserving target symmetries

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Efficiency and early fault detection with lower and higher strength combinatorial interaction testing

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
An orchestrated survey of methodologies for automated software test case generation

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop constraint programming models of the problem of finding an optimal covering array. Our models exploit global constraints, multiple viewpoints and symmetry-breaking constraints. We show that compound variables, representing tuples of variables in our original model, allow the constraints of this problem to be represented more easily and hence propagate better. With our best integrated model, we are able to either prove the optimality of existing bounds or find new optimal solutions, for arrays of moderate size. Local search on a SAT-encoding of the model is able to find improved solutions and bounds for larger problems.