Constraint-based approaches to the covering test problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3419 LNAI, Issue , 2005, Pages 172-186

  Hnich, Brahim ^a   Prestwich, Steven ^a   Selensky, Evgeny ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER HARDWARE; COMPUTER SOFTWARE; ENCODING (SYMBOLS); PROBLEM SOLVING;

BINARY CONSTRAINTS; DRUG SCREENING; REDUNDANT MODELING;

CONSTRAINT THEORY;

EID: 26844458310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11402763_13     Document Type: Conference Paper

References (26)

1. S. Y. Boroday and I. S. Grunskii. Recursive Generation of Locally Complete Tests. Cybernetics and Systems Analysis 28:20-25, 1992.
2. B. Cha and K. Iwama. Adding New Clauses for Faster Local Search. Proceedings of the Fourteenth National Conference on Artificial Intelligence, American Association for Artificial Intelligence 1996, pp. 332-337.
3. C. Cheng, A. Dimitresku, and P. Schroeder. Generating Small Combinatorial Test Suites to Cover Input-Output Relationships. Third International Conference On Quality Software (QSIC), USA, 2003, pp. 76-83.
4. D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton. The AETG System: An Approach to Testing Based on Combinatorial Design. IEEE Transactions on Software Engineering 23:437-444, 1997.
5. D. M. Cohen, S. R. Dalal, J. Parelius, and G. C. Patton. The Combinatorial Design Approach to Automatic Test Generation. IEEE Software, 1996, pp. 83-86.
6. D. Z. Du and F. K. Wang. Combinatorial Group Testing and Its Applications. World Scientific, 1991.
7. P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking Row and Column Symmetries in Matrix Models. P. van Hentenryck, editor, Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, 2002, pp. 462-476.
8. P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Matrix Modelling: Exploiting Common Patterns in Constraint Programming. A. M. Frisch, editor, Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, 2002, pp. 27-41.
9. G. Friedman, A. Hartman, K. Nagin, T. Shiran. Projected State Machine Coverage for Software Testing. A CM SIGSOFT International Symposium on Software Testing and Analysis, Roma, Italy, ACM Press, 2002, pp. 134-143.
10. A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Global Constraints for Lexicographic Orderings. P. van Hentenryck, editor, Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, 2002, pp. 93-108.
11. A. Hartman and L. Raskin. Problems and Algorithms for Covering Arrays. Discrete Mathematics 284:149-156, 2004.
12. J. Huller. Reducing Time to Market With Combinatorial Design Method Testing. Proceedings of the 2000 International Council on Systems Engineering (INCOSE) Conference, 2000.
13. A. B. Kahng and S. Reda. Combinatorial Group Testing Methods for the BIST Diagnosis Problem. Proceedings of Asia and South Pacific Design Automation Conference, 2004.
14. K. Kask and R. Dechter. GSAT and Local Consistency. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann 1995, pp. 616-622.
15. N. Kobayashi. Design and Evaluation of Automatic Test Generation Strategies for Functional Testing of Software. PhD Thesis, Osaka University, 2002.
16. Y. Lei and K. C. Tai. In-Parameter Order: a Test Generation Strategy for Pairwise Testing. Third IEEE High Assurance Systems Engineering Symposium, 1998, pp. 254-161.
17. K. J. Nurmela. Lower Bounds on 2-Covering Arrays by Exhaustive Search. Twenty-Fifth Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, 2000.
18. S. D. Prestwich. Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research 118:137-150, Kluwer Academic Publishers, 2003.
19. J.-C. Régin. Generalized Arc Consistency for Global Cardinality Constraints. Proceedings of the Eighth National Conference on Artificial Intelligence, 1996, pp. 25-32.
20. A. Renyi. Foundations of Probability. Wiley, New York, 1971.
21. B. Selman, H. Kautz, and B. Cohen. Noise Strategies for Improving Local Search. Twelfth National Conference on Artificial Intelligence, AAAI Press, 1994, pp. 337-343.
22. B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. Tenth National Conference on Artificial Intelligence, MIT Press, 1992, pp. 440-446.
23. G. Seroussi and N. H. Bshouty. Vector Sets for Exhaustive Testing of Logic Circuits. IEEE Transactions Information Theory 34:513-522, 1988.
24. D. T. Tang and C. L. Chen. Iterative Exhaustive Pattern Generation for Logic Testing. IBM Journal of Research and Development 28:212-219, 1984.
25. D. T. Tang and L. S. Woo. Exhaustive Test Pattern Generation With Constant Weight Vectors. IEEE Transactions Computers 32:1145-1150, 1983.
26. E. P. K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.