{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:28:48Z","timestamp":1740720528102,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642165603"},{"type":"electronic","value":"9783642165610"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16561-0_36","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:50:50Z","timestamp":1288705850000},"page":"382-396","source":"Crossref","is-referenced-by-count":2,"title":["Covering Arrays Generation Methods Survey"],"prefix":"10.1007","author":[{"given":"Victor","family":"Kuliamin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Petukhov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/(SICI)1520-6610(1999)7:3<185::AID-JCD3>3.0.CO;2-3","volume":"7","author":"B. Stevens","year":"1999","unstructured":"Stevens, B., Mendelsohn, E.: New recursive methods for transversal covers. Journal of Combinatorial Designs\u00a07(3), 185\u2013203 (1999)","journal-title":"Journal of Combinatorial Designs"},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"N. Sloane","year":"1993","unstructured":"Sloane, N.: Covering arrays and intersecting codes. Journal of Combinatorial Designs\u00a01(1), 51\u201363 (1993)","journal-title":"Journal of Combinatorial Designs"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M. Chateauneuf","year":"2002","unstructured":"Chateauneuf, M., Kreher, D.: On the state of strength-three covering arrays. Journal of Combinatorial Designs\u00a010(4), 217\u2013238 (2002)","journal-title":"Journal of Combinatorial Designs"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/B:DESI.0000029232.40302.6d","volume":"32","author":"S. Martirosyan","year":"2004","unstructured":"Martirosyan, S., Van Trung, T.: Tran Van Trung: On t-covering arrays. Designs, Codes and Cryptography\u00a032, 323\u2013339 (2004)","journal-title":"Designs, Codes and Cryptography"},{"key":"36_CR5","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 Math.\u00a0284, 149\u2013156 (2004)","journal-title":"Discrete Math."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.disc.2006.06.036","volume":"308","author":"M. Cohen","year":"2008","unstructured":"Cohen, M., Colbourn, C., Ling, A.: Constructing Strength Three Covering Arrays with Augmented Annealing. Discrete Mathematics\u00a0308, 2709\u20132722 (2008)","journal-title":"Discrete Mathematics"},{"issue":"7","key":"36_CR7","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"D. Cohen","year":"1996","unstructured":"Cohen, D., Dalal, S., Fredman, M., Patton, G.: The AETG System: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering\u00a023(7), 437\u2013444 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(03)00291-9","volume":"138","author":"K. Nurmela","year":"2004","unstructured":"Nurmela, K.: Upper bounds for covering arrays by tabu search. Discrete Applied Math.\u00a0138, 143\u2013152 (2004)","journal-title":"Discrete Applied Math."},{"issue":"1","key":"36_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"C. Colbourn","year":"2006","unstructured":"Colbourn, C., Martirosyan, S., Van Trung, T., Walker II, R.: Roux-type Constructions for Covering Arrays of Strengths Three and Four Designs. Codes and Cryptography\u00a041(1), 33\u201357 (2006)","journal-title":"Codes and Cryptography"},{"key":"36_CR10","unstructured":"Stevens, B.: Transversal Covers and Packings. PhD. Thesis, Mathematics, University of Toronto (1998)"},{"key":"36_CR11","unstructured":"Patton, G.: DAT (Defect Analysis Team)1986-1990 Overview. Internal Bellcore Technical Memo (1991)"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, M., Colbourn, C., Ling, A.: Augmenting Sumulated Annealing to Build Interaction Test Suites. In: Proc Intl. Symposium Software Requirements Engineering, pp. 394\u2013405 (2003)","DOI":"10.1109\/ISSRE.2003.1251061"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck, G.: New Optimization Heuristic \u2013 The Great Deluge Algorithm and the Record-To-Record Travel. Journal of Computational Physics\u00a0104, 86\u201392 (1993)","journal-title":"Journal of Computational Physics"},{"key":"36_CR14","first-page":"145","volume":"63","author":"B. Stevens","year":"2002","unstructured":"Stevens, B., Ling, A., Mendelsohn, E.: A direct construction of transversal coversusing group divisible designs. Ars. Combin.\u00a063, 145\u2013159 (2002)","journal-title":"Ars. Combin."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold Accepting: A general purpose optimization algorithm appearing superior to simulating annealing. Journal of Computational Physics\u00a090, 161\u2013175 (1990)","journal-title":"Journal of Computational Physics"},{"key":"36_CR16","unstructured":"Stardom, J.: Metaheuristic and the search for covering and packing arrays. Master\u2019s thesis, Simon Fraser University (2001)"},{"key":"36_CR17","unstructured":"Jenkins, B.: Tool for pairwise testing (2005), http:\/\/burtleburtle.net\/bob\/math\/jenny.html"},{"key":"36_CR18","unstructured":"Lei, Y., Tai, K.: In-parameter order: A test generation strategy for pairwise testing. In: Proc. 3rd IEEE High Assurance System Engineering Symposium, pp. 254\u2013161 (1998)"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G. Seroussi","year":"1988","unstructured":"Seroussi, G., Bshouty, N.: Vector sets for exhaustive testing of logic circuits. IEEE Trans. Information Theory\u00a034, 513\u2013522 (1988)","journal-title":"IEEE Trans. Information Theory"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Cohen, D., Dalal, S., Parelius, J., Patton, G.: The Combinatorial Design Approach to Automatic Test Generation. IEEE Software, 83\u201387 (September 1996)","DOI":"10.1109\/52.536462"},{"key":"36_CR21","unstructured":"Pairwise Testing, Combinatorial Test Case Generation, http:\/\/www.pairwise.org\/tools.asp"},{"key":"36_CR22","first-page":"121","volume":"58","author":"C. Colbourn","year":"2004","unstructured":"Colbourn, C.: Combinatorial aspects of covering arrays. Le Matematiche (Catania)\u00a058, 121\u2013167 (2004)","journal-title":"Le Matematiche (Catania)"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Cohen, D., Dalal, S., Fredman, M., Patton, G.: The Automatic Efficient Test Generator (AETG) System. In: Proceedings of 5th International Symposium on Software Reliability Engineering, November 6-9, pp. 303\u2013309 (1994)","DOI":"10.1109\/ISSRE.1994.341392"},{"key":"36_CR24","unstructured":"Colbourn, C., Cohen, M., Turban, R.: A deterministic density algorithm for pairwise interaction coverage. In: Proc. of the IASTED Intl. Conference on Software Engineering, pp. 242\u2013252 (February 2004)"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Williams, A.: Determination of Test Configurations for Pairwise Interaction Coverage. In: Proceedings of the 13th International Conference on Testing Communicating Systems (Test-Com 2000), pp. 59\u201374 (2000)","DOI":"10.1007\/978-0-387-35516-0_4"},{"key":"36_CR26","unstructured":"Cormen, T., Stein, C., Rivest, R., Leiserson, C.: Greedy algorithms \/\/ Introduction to Algorithms, 2nd edn., vol.\u00a016. Moscow Viliyams (2006)"},{"issue":"3","key":"36_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/stvr.319","volume":"15","author":"M. Grindal","year":"2005","unstructured":"Grindal, M., Offutt, A., Andler, S.: Combination testing strategies: A survey. Software Testing, Verification, and Reliability\u00a015(3), 167\u2013199 (2005)","journal-title":"Software Testing, Verification, and Reliability"},{"key":"36_CR28","doi-asserted-by":"crossref","unstructured":"Hartman, A.: Software and Hardware Testing Using Combinatorial Covering Suites. In: Proc. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications, pp. 266\u2013327 (2005)","DOI":"10.1007\/0-387-25036-0_10"},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/S0036144595293959","volume":"39","author":"A. Edelman","year":"1997","unstructured":"Edelman, A.: The mathematics of the Pentium division bug. SIAM Review\u00a039, 54\u201367 (1997)","journal-title":"SIAM Review"},{"key":"36_CR30","doi-asserted-by":"crossref","unstructured":"Greene, C.: Sperner families and partitions of a partially ordered set. In: Hall Jr., M., van Lint, J. (eds.) Combinatorics, Dordrecht, Holland, pp. 277\u2013290 (1975)","DOI":"10.1007\/978-94-010-1826-5_15"},{"key":"36_CR31","doi-asserted-by":"crossref","unstructured":"Williams, A., Probert, R.: A measure for component interaction test coverage. In: Proc. ACS\/IEEE Intl. Conf. on Computer Systems and Applications, pp. 301\u2013311 (2001)","DOI":"10.1109\/AICCSA.2001.934001"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Ammann, P., Offutt, J.: Using Formal Methods to Derive Test Frames in Category-Partition Testing Safety, Reliability, Fault Tolerance, Concurrency, and Real Time Security. In: Proc. Ninth Ann. Conf. Computer Assurance (COMPASS 1994), pp. 69\u201379 (1994)","DOI":"10.1109\/CMPASS.1994.318466"},{"key":"36_CR33","unstructured":"Zelenov, S., Zelenova, S.: Automated negative and positive test generation for testing a syntax analysis phase. Works of Institute for System Programming RAS, russian (2004)"},{"key":"36_CR34","unstructured":"Documentation on Webmoney interface WM Keeper Light, http:\/\/www.wmtransfer.com\/eng\/about\/demo\/light\/index.shtml"},{"key":"36_CR35","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/jcd.20065","volume":"14","author":"C. Colbourn","year":"2006","unstructured":"Colbourn, C., Martirosyan, S., Mullen, G., Shasha, D., Yucas, J., Sherwood, G.: Products of Mixed Covering Arrays of Strength Two. J. Combin. Des.\u00a014, 124\u2013138 (2006)","journal-title":"J. Combin. Des."},{"key":"36_CR36","unstructured":"Tung, Y.-W., Aldiwan, W.: Automating test case generation for the new generation mission software system. In: Proc. IEEE Aerospace Conf., pp. 431\u2013437 (2000)"},{"key":"36_CR37","doi-asserted-by":"crossref","unstructured":"Bryce, R., Colbourn, C.: One-Test-at-a-Time Heuristic Search for Interaction Test Suites. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Search-based Software Engineering track (SBSE), London, England, pp. 1082\u20131089 (2007)","DOI":"10.1145\/1276958.1277173"},{"key":"36_CR38","volume-title":"Finite fields","author":"R. Lidl","year":"1988","unstructured":"Lidl, R., Niederreiter, H.: Finite fields, vol.\u00a02. Mir, Moscow (1988)"},{"key":"36_CR39","unstructured":"Tables for the smallest known covering arrays, http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/catable.html"},{"key":"36_CR40","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1017\/S0963548300001905","volume":"5","author":"A. Godbole","year":"1996","unstructured":"Godbole, A., Skipper, D., Sunley, R.: t-Covering arrays: upper bounds and Poisson approximations. Combinatorics, Probability and Computing\u00a05, 105\u2013118 (1996)","journal-title":"Combinatorics, Probability and Computing"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification, and Validation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16561-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T13:52:09Z","timestamp":1740664329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16561-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642165603","9783642165610"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16561-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}