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.
The first author is supported by Science Foundation Ireland and an Ilog license grant. The third author is supported by Bausch&Lomb Ireland and Enterprise Ireland. This work has also received support from Science Foundation Ireland under Grant 00/PI.1/C075.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Boroday, S.Y., Grunskii, I.S.: Recursive Generation of Locally Complete Tests. Cybernetics and Systems Analysis 28, 20–25 (1992)
Cha, B., Iwama, K.: Adding New Clauses for Faster Local Search. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 332–337. American Association for Artificial Intelligence (1996)
Cheng, C., Dimitresku, A., Schroeder, P.: Generating Small Combinatorial Test Suites to Cover Input-Output Relationships. In: Third International Conference on Quality Software (QSIC), USA, pp. 76–83 (2003)
Cohen, D.M., Dalal, S.R., Fredman, M.L., Patton, G.C.: The AETG System: An Approach to Testing Based on Combinatorial Design. IEEE Transactions on Software Engineering 23, 437–444 (1997)
Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The Combinatorial Design Approach to Automatic Test Generation. IEEE Software, 83–86 (1996)
Du, D.Z., Wang, F.K.: Combinatorial Group Testing and Its Applications. World Scientific, Singapore (1991)
Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking Row and Column Symmetries in Matrix Models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462–476. Springer, Heidelberg (2002)
Flener, P., Frisch, A.M., Hnich, B., Kızıltan, Z., Miguel, I., Walsh, T.: Matrix Modelling: Exploiting Common Patterns in Constraint Programming. In: Frisch, A.M. (ed.) Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, pp. 27–41 (2002)
Friedman, G., Hartman, A., Nagin, K., Shiran, T.: Projected State Machine Coverage for Software Testing. In: ACM SIGSOFT International Symposium on Software Testing and Analysis, Roma, Italy, pp. 134–143. ACM Press, New York (2002)
Frisch, A.M., Hnich, B., Kızıltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 93–108. Springer, Heidelberg (2002)
Hartman, A., Raskin, L.: Problems and Algorithms for Covering Arrays. Discrete Mathematics 284, 149–156 (2004)
Huller, J.: Reducing Time to Market With Combinatorial Design Method Testing. In: Proceedings of the 2000 International Council on Systems Engineering (INCOSE) Conference (2000)
Kahng, A.B., Reda, S.: Combinatorial Group Testing Methods for the BIST Diagnosis Problem. In: Proceedings of Asia and South Pacific Design Automation Conference (2004)
Kask, K., Dechter, R.: GSAT and Local Consistency. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 616–622. Morgan Kaufmann, San Francisco (1995)
Kobayashi, N.: Design and Evaluation of Automatic Test Generation Strategies for Functional Testing of Software. PhD Thesis, Osaka University (2002)
Lei, Y., Tai, K.C.: In-Parameter Order: a Test Generation Strategy for Pairwise Testing. In: Third IEEE High Assurance Systems Engineering Symposium, pp. 254–161 (1998)
Nurmela, K.J.: Lower Bounds on 2-Covering Arrays by Exhaustive Search. In: Twenty- Fifth Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (2000)
Prestwich, S.D.: Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research 118, 137–150 (2003)
Régin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraints. In: Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 25–32 (1996)
Renyi, A.: Foundations of Probability. Wiley, New York (1971)
Selman, B., Kautz, H., Cohen, B.: Noise Strategies for Improving Local Search. In: Twelfth National Conference on Artificial Intelligence, pp. 337–343. AAAI Press, Menlo Park (1994)
Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Tenth National Conference on Artificial Intelligence, pp. 440–446. MIT Press, Cambridge (1992)
Seroussi, G., Bshouty, N.H.: Vector Sets for Exhaustive Testing of Logic Circuits. IEEE Transactions Information Theory 34, 513–522 (1988)
Tang, D.T., Chen, C.L.: Iterative Exhaustive Pattern Generation for Logic Testing. IBM Journal of Research and Development 28, 212–219 (1984)
Tang, D.T., Woo, L.S.: Exhaustive Test Pattern Generation With Constant Weight Vectors. IEEE Transactions Computers 32, 1145–1150 (1983)
Tsang, E.P.K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hnich, B., Prestwich, S., Selensky, E. (2005). Constraint-Based Approaches to the Covering Test Problem. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2004. Lecture Notes in Computer Science(), vol 3419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11402763_13
Download citation
DOI: https://doi.org/10.1007/11402763_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25176-7
Online ISBN: 978-3-540-32252-8
eBook Packages: Computer ScienceComputer Science (R0)