Constraint-Based approaches to the covering test problem

Authors:
Brahim Hnich;Steven Prestwich;Evgeny Selensky
Affiliations:
Cork Constraint Computation Center, University College, Cork, Ireland;Cork Constraint Computation Center, University College, Cork, Ireland;Cork Constraint Computation Center, University College, Cork, Ireland
Venue:
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Year:
2004

Citing 15
Cited 6

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
Projected state machine coverage for software testing

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
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
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships

QSIC '03 Proceedings of the Third International Conference on Quality Software
Combinatorial group testing methods for the BIST diagnosis problem

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Exhaustive Test Pattern Generation with Constant Weight Vectors

IEEE Transactions on Computers
GSAT and local consistency

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Iterative exhaustive pattern generation for logic testing

IBM Journal of Research and Development
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
Adding new clauses for faster local search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Constraint Models for the Covering Test Problem

Constraints
Coverage and adequacy in software product line testing

Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
Roux-type constructions for covering arrays of strengths three and four

Designs, Codes and Cryptography
A survey of combinatorial testing

ACM Computing Surveys (CSUR)
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
The Minimal Failure-Causing Schema of Combinatorial Testing

ACM Transactions on Software Engineering and Methodology (TOSEM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our proposed models exploit non-binary (global) constraints, redundant modelling, channelling constraints, and symmetry breaking constraints. Our initial experiments show that with our best integrated model, we are able to either prove optimality of existing bounds or find new optimal values for arrays of moderate size. Local search on a SAT-encoding of the model is able to find improved bounds on larger problems.