{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:50Z","timestamp":1725558950530},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540251767"},{"type":"electronic","value":"9783540322528"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11402763_13","type":"book-chapter","created":{"date-parts":[[2005,10,21]],"date-time":"2005-10-21T11:15:23Z","timestamp":1129893323000},"page":"172-186","source":"Crossref","is-referenced-by-count":21,"title":["Constraint-Based Approaches to the Covering Test Problem"],"prefix":"10.1007","author":[{"given":"Brahim","family":"Hnich","sequence":"first","affiliation":[]},{"given":"Steven","family":"Prestwich","sequence":"additional","affiliation":[]},{"given":"Evgeny","family":"Selensky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"20","volume":"28","author":"S.Y. Boroday","year":"1992","unstructured":"Boroday, S.Y., Grunskii, I.S.: Recursive Generation of Locally Complete Tests. Cybernetics and Systems Analysis\u00a028, 20\u201325 (1992)","journal-title":"Cybernetics and Systems Analysis"},{"key":"13_CR2","unstructured":"Cha, B., Iwama, K.: Adding New Clauses for Faster Local Search. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 332\u2013337. American Association for Artificial Intelligence (1996)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"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\u201383 (2003)","DOI":"10.1109\/QSIC.2003.1319088"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"D.M. Cohen","year":"1997","unstructured":"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\u00a023, 437\u2013444 (1997)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, D.M., Dalal, S.R., Parelius, J., Patton, G.C.: The Combinatorial Design Approach to Automatic Test Generation. IEEE Software, 83\u201386 (1996)","DOI":"10.1109\/52.536462"},{"key":"13_CR6","volume-title":"Combinatorial Group Testing and Its Applications","author":"D.Z. Du","year":"1991","unstructured":"Du, D.Z., Wang, F.K.: Combinatorial Group Testing and Its Applications. World Scientific, Singapore (1991)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-46135-3_31","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"P. Flener","year":"2002","unstructured":"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.\u00a02470, pp. 462\u2013476. Springer, Heidelberg (2002)"},{"key":"13_CR8","unstructured":"Flener, P., Frisch, A.M., Hnich, B., K\u0131z\u0131ltan, 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\u201341 (2002)"},{"key":"13_CR9","first-page":"134","volume-title":"ACM SIGSOFT International Symposium on Software Testing and Analysis","author":"G. Friedman","year":"2002","unstructured":"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\u2013143. ACM Press, New York (2002)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-46135-3_7","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"A.M. Frisch","year":"2002","unstructured":"Frisch, A.M., Hnich, B., K\u0131z\u0131ltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 93\u2013108. Springer, Heidelberg (2002)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A. Hartman","year":"2004","unstructured":"Hartman, A., Raskin, L.: Problems and Algorithms for Covering Arrays. Discrete Mathematics\u00a0284, 149\u2013156 (2004)","journal-title":"Discrete Mathematics"},{"key":"13_CR12","unstructured":"Huller, J.: Reducing Time to Market With Combinatorial Design Method Testing. In: Proceedings of the 2000 International Council on Systems Engineering (INCOSE) Conference (2000)"},{"key":"13_CR13","unstructured":"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)"},{"key":"13_CR14","first-page":"616","volume-title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","author":"K. Kask","year":"1995","unstructured":"Kask, K., Dechter, R.: GSAT and Local Consistency. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 616\u2013622. Morgan Kaufmann, San Francisco (1995)"},{"key":"13_CR15","unstructured":"Kobayashi, N.: Design and Evaluation of Automatic Test Generation Strategies for Functional Testing of Software. PhD Thesis, Osaka University (2002)"},{"key":"13_CR16","unstructured":"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\u2013161 (1998)"},{"key":"13_CR17","unstructured":"Nurmela, K.J.: Lower Bounds on 2-Covering Arrays by Exhaustive Search. In: Twenty- Fifth Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (2000)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1021809724362","volume":"118","author":"S.D. Prestwich","year":"2003","unstructured":"Prestwich, S.D.: Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research\u00a0118, 137\u2013150 (2003)","journal-title":"Annals of Operations Research"},{"key":"13_CR19","unstructured":"R\u00e9gin, J.-C.: Generalized Arc Consistency for Global Cardinality Constraints. In: Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 25\u201332 (1996)"},{"key":"13_CR20","volume-title":"Foundations of Probability","author":"A. Renyi","year":"1971","unstructured":"Renyi, A.: Foundations of Probability. Wiley, New York (1971)"},{"key":"13_CR21","first-page":"337","volume-title":"Twelfth National Conference on Artificial Intelligence","author":"B. Selman","year":"1994","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise Strategies for Improving Local Search. In: Twelfth National Conference on Artificial Intelligence, pp. 337\u2013343. AAAI Press, Menlo Park (1994)"},{"key":"13_CR22","first-page":"440","volume-title":"Tenth National Conference on Artificial Intelligence","author":"B. Selman","year":"1992","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Tenth National Conference on Artificial Intelligence, pp. 440\u2013446. MIT Press, Cambridge (1992)"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G. Seroussi","year":"1988","unstructured":"Seroussi, G., Bshouty, N.H.: Vector Sets for Exhaustive Testing of Logic Circuits. IEEE Transactions Information Theory\u00a034, 513\u2013522 (1988)","journal-title":"IEEE Transactions Information Theory"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1147\/rd.282.0212","volume":"28","author":"D.T. Tang","year":"1984","unstructured":"Tang, D.T., Chen, C.L.: Iterative Exhaustive Pattern Generation for Logic Testing. IBM Journal of Research and Development\u00a028, 212\u2013219 (1984)","journal-title":"IBM Journal of Research and Development"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/TC.1983.1676175","volume":"32","author":"D.T. Tang","year":"1983","unstructured":"Tang, D.T., Woo, L.S.: Exhaustive Test Pattern Generation With Constant Weight Vectors. IEEE Transactions Computers\u00a032, 1145\u20131150 (1983)","journal-title":"IEEE Transactions Computers"},{"key":"13_CR26","volume-title":"Foundations of Constraint Satisfaction","author":"E.P.K. Tsang","year":"1993","unstructured":"Tsang, E.P.K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11402763_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:46:50Z","timestamp":1558280810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11402763_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540251767","9783540322528"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11402763_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}