{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:55:00Z","timestamp":1778522100132,"version":"3.51.4"},"reference-count":56,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1134\/s0361768811030029","type":"journal-article","created":{"date-parts":[[2011,5,23]],"date-time":"2011-05-23T19:48:10Z","timestamp":1306180090000},"page":"121-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["A survey of methods for constructing covering arrays"],"prefix":"10.1134","volume":"37","author":[{"given":"V. V.","family":"Kuliamin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Petukhov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2011,5,25]]},"reference":[{"issue":"1","key":"6100_CR1","first-page":"41","volume":"8","author":"S.V. Zelenov","year":"2004","unstructured":"Zelenov, S.V. and Zelenova, S.A., Automatic Generation of Positive and Negative Tests for Testing Syntactic Analysis Phase, Trudy Instituta Sistemnogo Programmirovaniya RAN (Proceedings of the Institute of System Programming, RAS), 2004, vol. 8, no. 1, pp. 41\u201358.","journal-title":"Trudy Instituta Sistemnogo Programmirovaniya RAN"},{"key":"6100_CR2","doi-asserted-by":"crossref","unstructured":"Hoffman, D., Sobotkiewicz, L., Wang Hong-Yi, Strooper, P., Bazdell, G., and Stevens, B., Test Generation with Context Free Grammars and Covering Arrays, in Testing: Academic and Industrial Conf. \u2014 Practice and Research Techniques, Windsor, UK, 2009, pp. 83\u201387.","DOI":"10.1109\/TAICPART.2009.35"},{"key":"6100_CR3","doi-asserted-by":"crossref","unstructured":"Ammann, P. and Offutt, J., Using Formal Methods to Derive Test Frames in Category-Partition Testing, Safety, Reliability, Fault Tolerance, Concurrency, and Real Time Security: Proc. of the 9-th Ann. Conf. on Computer Assurance (COMPASS\u201994), 1994, pp. 69\u201379.","DOI":"10.1109\/CMPASS.1994.318466"},{"issue":"7","key":"6100_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"D.M. Cohen","year":"1996","unstructured":"Cohen, D.M., Dalal, S.R., Fredman, M.L., and Patton, G.C., The AETG System: An Approach to Testing Based on Combinatorial Design, IEEE Trans. Software Engineering, 1996, vol. 23, no. 7, pp. 437\u2013444.","journal-title":"IEEE Trans. Software Engineering"},{"key":"6100_CR5","doi-asserted-by":"crossref","unstructured":"Williams, A.W., Determination of Test Configurations for Pairwise Interaction Coverage, Proc. of 13-th Int. Conf. on Testing Communicating Systems (TestCom), 2000, pp. 59\u201374.","DOI":"10.1007\/978-0-387-35516-0_4"},{"key":"6100_CR6","unstructured":"Williams, W. and Probert, R.L., A Measure for Component Interaction Test Coverage, Proc. ACS\/IEEE Int. Conf. on Computer Systems and Applications, 2001, pp. 301\u2013311."},{"key":"6100_CR7","doi-asserted-by":"crossref","unstructured":"Bryce, R. and Colbourn, C.J., One-Test-at-a-Time Heuristic Search for Interaction Test Suites, Proc. of Genetic and Evolutionary Computation Conf. (GECCO), Search-based Software Engineering track (SBSE), London, 2007, pp. 1082\u20131089.","DOI":"10.1145\/1276958.1277173"},{"key":"6100_CR8","doi-asserted-by":"crossref","unstructured":"Calvagna, A. and Gargantini, A., Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing, Proc. of the 3-rd Int. Conf. on Tests and Proofs, Zurich, 2009, pp. 27\u201342.","DOI":"10.1007\/978-3-642-02949-3_4"},{"key":"6100_CR9","unstructured":"Documentation on Service WM Keeper Light. http:\/\/webmoney.ru\/rus\/about\/demo\/light\/index.shtml"},{"key":"6100_CR10","unstructured":"Patton, G.C., DAT (Defect Analysis Team) 1986\u20131990 Overview, Internal Bellcore Technical Memo, 1991."},{"issue":"5","key":"6100_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"D.M. Cohen","year":"1996","unstructured":"Cohen, D.M., Dalal, S.R., Parelius, J., and Patton, G.C., The Combinatorial Design Approach to Automatic Test Generation, IEEE Software, 1996, vol. 13, no. 5, pp. 83\u201387.","journal-title":"IEEE Software"},{"issue":"3","key":"6100_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G. Seroussi","year":"1988","unstructured":"Seroussi, G. and Bshouty, N.H., Vector Sets for Exhaustive Testing of Logic Circuits, IEEE Trans. Information Theory, 1988, vol. 34, no. 3, pp. 513\u2013522.","journal-title":"IEEE Trans. Information Theory"},{"key":"6100_CR13","unstructured":"Lei, Y. and Tai, K.C., In-parameter Order: A Test Generation Strategy for Pairwise Testing, Proc. of the 3rd IEEE High Assurance System Engineering Symp., 1998, pp. 254\u2013261."},{"key":"6100_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1017\/S0963548300001905","volume":"5","author":"A.P. Godbole","year":"1996","unstructured":"Godbole, A.P., Skipper, D.E., and Sunley, R.A., T-Covering Arrays: Upper Bounds and Poisson Approximations, Combinatorics, Probability Computing, 1996, vol. 5, pp.105\u2013118.","journal-title":"Combinatorics, Probability Computing"},{"issue":"s.1\u20133","key":"6100_CR15","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. and Van Trung, T., On T-covering Arrays, Designs, Codes and Cryptography, 2004, vol. 32, nos. 1\u20133, pp. 323\u2013339.","journal-title":"Designs, Codes and Cryptography"},{"key":"6100_CR16","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. and Raskin, L., Problems and Algorithms for Covering Arrays, Discrete Math., 2004, vol. 284, pp. 149\u2013156.","journal-title":"Discrete Math."},{"key":"6100_CR17","first-page":"121","volume":"58","author":"C.J. Colbourn","year":"2004","unstructured":"Colbourn, C.J., Combinatorial Aspects of Covering Arrays, Le Matematiche (Catania), 2004, vol. 58, pp. 121\u2013167.","journal-title":"Le Matematiche (Catania)"},{"issue":"3","key":"6100_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/stvr.319","volume":"15","author":"M. Grindal","year":"2005","unstructured":"Grindal, M., Offutt, A.J., and Andler, S.F., Combination Testing Strategies: A Survey, Software Testing, Verification, Reliability, 2005, vol. 15, no. 3, pp. 167\u2013199.","journal-title":"Software Testing, Verification, Reliability"},{"key":"6100_CR19","unstructured":"Hartman, A., Software and Hardware Testing Using Combinatorial Covering Suites, Proc. of Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications, 2005, pp. 266\u2013327."},{"issue":"11","key":"6100_CR20","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1016\/j.dam.2010.03.008","volume":"158","author":"C.J. Colbourn","year":"2010","unstructured":"Colbourn, C.J., Keri, G., Rivas Soriano, P.P., Schlage-Puchta, J.-C., Covering and Radius-Covering Arrays: Constructions and Classification, Discrete Applied Math., 2010, vol. 158, no. 11, pp. 1158\u20131180.","journal-title":"Discrete Applied Math."},{"issue":"s.5\u20136","key":"6100_CR21","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.disc.2007.07.050","volume":"308","author":"C.J. Colbourn","year":"2008","unstructured":"Colbourn, C.J., Strength Two Covering Arrays: Existence Tables and Projection, Discrete Math., 2008, vol. 308, nos. 5\u20136, pp. 772\u2013786.","journal-title":"Discrete Math."},{"issue":"5","key":"6100_CR22","doi-asserted-by":"crossref","first-page":"287","DOI":"10.6028\/jres.113.022","volume":"113","author":"M. Forbes","year":"2008","unstructured":"Forbes, M., Lawrence, J., Lei, Y., Kacker, R.N., and Kuhn, D.R., Refining the In-parameter-order Strategy for Constructing Covering Arrays, J. Res. Nat. Inst. Stand. Tech., 2008, vol. 113, no. 5, pp. 287\u2013297.","journal-title":"J. Res. Nat. Inst. Stand. Tech."},{"key":"6100_CR23","unstructured":"Konstantinov, A.V., Automation of Test Construction with the Use of Combinatorial Methods, MS Thesis, Moscow State University, 2007."},{"issue":"5","key":"6100_CR24","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TSE.2008.50","volume":"34","author":"M.B. Cohen","year":"2008","unstructured":"Cohen, M.B., Dwyer, M.B., and Shi, J., Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach, IEEE Trans. Software Eng., 2008, vol. 34, no, 5, pp. 633\u2013650.","journal-title":"IEEE Trans. Software Eng."},{"key":"6100_CR25","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Dwyer, M.B., and Shi, J., Exploiting Constraint Solving History to Construct Interaction Test Suites, Testing: Academic and Industrial Conference Practice and Research Techniques \u2014 MUTATION, 2007, pp. 121\u2013132.","DOI":"10.1109\/TAIC.PART.2007.17"},{"key":"6100_CR26","unstructured":"Czerwonka, J., Pairwise Testing in Real World, 24-th Pacific Northwest Software Quality Conference, 2006."},{"issue":"10","key":"6100_CR27","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1016\/j.jss.2008.02.034","volume":"81","author":"J. Yan","year":"2008","unstructured":"Yan, J. and Zhang, J., A Backtracking Search Tool for Constructing Combinatorial Test Suites, J. System Software, 2008, vol. 81, no. 10, pp. 1681\u20131693.","journal-title":"J. System Software"},{"key":"6100_CR28","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-10217-2_40","volume":"5874","author":"P. Nayeri","year":"2009","unstructured":"Nayeri, P., Colbourn, C.J., and Konjevod, G., Randomized Postoptimization of Covering Arrays, Lecture Notes in Computer Science, Springer, 2009, vol. 5874, pp. 408\u2013419.","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"6100_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, 1997, vol. 39, no. 1, pp. 54\u201367.","journal-title":"SIAM Review"},{"key":"6100_CR30","doi-asserted-by":"crossref","unstructured":"Greene, C., Sperner Families and Partitions of a Partially Ordered Set, Combinatorics, Hall, Jr., M. and van Lint, J., Eds., Dordrecht, Holland, 1975, pp. 277\u2013290.","DOI":"10.1007\/978-94-010-1826-5_15"},{"key":"6100_CR31","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R. and Niederreiter, H., Finite Fields, Reading, Mass.: Addison-Wesley, 1983. Translated under the title Konechnye polya, Moscow: Mir, 1988."},{"issue":"4","key":"6100_CR32","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M. Chateauneuf","year":"2002","unstructured":"Chateauneuf, M. and Kreher, D., On the State of Strength-three Covering Arrays, J. Combinatorial Designs, 2002, vol. 10, no. 4, pp. 217\u2013238.","journal-title":"J. Combinatorial Designs"},{"issue":"2","key":"6100_CR33","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/jcd.20065","volume":"14","author":"J. Colbourn","year":"2006","unstructured":"Colbourn, J., Martirosyan, S.S., Mullen, G.L., Shasha, D., Yucas, J.L., and Sherwood, G.B., Products of Mixed Covering Arrays of Strength Two, J. Combinatorial Design, 2006, vol. 14, no. 2, pp. 124\u2013138.","journal-title":"J. Combinatorial Design"},{"issue":"1","key":"6100_CR34","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1002\/jcd.20035","volume":"13","author":"K. Meagher","year":"2005","unstructured":"Meagher, K. and Stevens, B., Group Construction of Covering Arrays, J. Combinatorial Design, 2005, vol. 13, no. 1, pp. 70\u201377.","journal-title":"J. Combinatorial Design"},{"issue":"2","key":"6100_CR35","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.jcta.2003.09.005","volume":"104","author":"J. Yin","year":"2003","unstructured":"Yin, J., Constructions of Difference Covering Arrays, J. Combinatorial Theory (A), 2003, vol. 104, no. 2, pp. 327\u2013339.","journal-title":"J. Combinatorial Theory (A)"},{"key":"6100_CR36","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harari","year":"1969","unstructured":"Harari, F., Graph Theory, Reading, Mass.: Addison-Wesley, 1969. Translated under the title Teoriya grafov, Moscow: Mir, 1973."},{"key":"6100_CR37","unstructured":"Tables of the Known Least Covering Arrays. http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/catable.html."},{"issue":"1","key":"6100_CR38","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, J. Combinatorial Designs, 1993, vol. 1, no. 1, pp. 51\u201363.","journal-title":"J. Combinatorial Designs"},{"issue":"13","key":"6100_CR39","doi-asserted-by":"publisher","first-page":"2709","DOI":"10.1016\/j.disc.2006.06.036","volume":"308","author":"M.B. Cohen","year":"2008","unstructured":"Cohen, M.B., Colbourn, C.J., and Ling, A.C.H., Constructing Strength Three Covering Arrays with Augmented Annealing, Discrete Math., 2008, vol. 308, no. 13, pp. 2709\u20132722.","journal-title":"Discrete Math."},{"issue":"1","key":"6100_CR40","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"C.J. Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S.S., Van Trung, T., and Walker II, R.A., Roux-type Constructions for Covering Arrays of Strengths Three and Four, Designs, Codes Cryptography, 2006, vol. 41, no. 1, pp. 33\u201357.","journal-title":"Designs, Codes Cryptography"},{"issue":"3","key":"6100_CR41","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. and Mendelsohn, E., New Recursive Methods for Transversal Covers, J. Combinatorial Designs, 1999, vol. 7, no. 3, pp. 185\u2013203.","journal-title":"J. Combinatorial Designs"},{"key":"6100_CR42","first-page":"145","volume":"63","author":"B. Stevens","year":"2002","unstructured":"Stevens, B., Ling, A., and Mendelsohn, E., A Direct Construction of Transversal Covers Using Group Divisible Designs, Ars Combin., 2002, vol. 63, pp. 145\u2013159.","journal-title":"Ars Combin."},{"key":"6100_CR43","unstructured":"Cormen, T., Leiserson, C., Rivest, R., and Stein, K., Introduction to Algorithms, The MIT Press, 2001, 2nd ed. Chapter 16: Greedy Algorithms."},{"key":"6100_CR44","doi-asserted-by":"crossref","unstructured":"Calvaga, A. and Gargantini, A., IPO-s: Incremental Generation of Combinatorial Interaction Test Data Based on Symmetries of Covering Arrays, Proc. of the IEEE Int. Conf. on Software Testing Verification and Validation Workshops, Denver, Colorado, 2009.","DOI":"10.1109\/ICSTW.2009.7"},{"key":"6100_CR45","doi-asserted-by":"crossref","unstructured":"Cohen, M., Dalal, S.R., Fredman, M.L., and Patton, G.C., The Automatic Efficient Test Generator (AETG) System, Proc. of the 5-th Int. Symp. on Software Reliability Engineering, 1994, pp. 303\u2013309.","DOI":"10.1109\/ISSRE.1994.341392"},{"key":"6100_CR46","unstructured":"Colbourn, C.J., Cohen, M.B., and Turban, R.C., A Deterministic Density Algorithm for Pairwise Interaction Coverage, Proc. of the IASTED Int. Conf. on Software Engineering, 2004, pp. 242\u2013252."},{"key":"6100_CR47","unstructured":"Tung, Y.-W. and Aldiwan, W.S., Automating Test Case Generation for the New Generation Mission Software System, Proc. IEEE Aerospace Conf., 2000, pp. 431\u2013437."},{"key":"6100_CR48","unstructured":"Jenkins, B., Tool for Pairwise Testing. http:\/\/burtleburtle.net\/bob\/math\/jenny.html, 2005."},{"key":"6100_CR49","unstructured":"Pairwise Testing, Combinatorial Test Case Generation. http:\/\/www.pairwise.org\/tools.asp."},{"issue":"s.1\u20132","key":"6100_CR50","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 Bunds for Covering Arrays by Tabu Search, Discrete Applied Math., 2004, vol. 138, nos. 1\u20132, pp. 143\u2013152.","journal-title":"Discrete Applied Math."},{"key":"6100_CR51","unstructured":"Stardom, J., Metaheuristic and the Search for Covering and Packing Arrays, MS Thesis, Simon Fraser University, 2001."},{"key":"6100_CR52","unstructured":"Stevens, B., Transversal Covers and Packings, Ph. D. Thesis, Mathematics, Univ. of Toronto, 1998."},{"key":"6100_CR53","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Colbourn, C.J., and Ling, A.C.H., Augmenting Simulated Annealing to Build Interaction Test Suites, Proc. of Int. Symp. Software Requirements Engineering, (ISSRE 2003), 2003, pp. 394\u2013405.","DOI":"10.1109\/ISSRE.2003.1251061"},{"key":"6100_CR54","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 \u2014 The Great Deluge Algorithm and the Record-To-Record Travel, J. Computational Phys., 1993, vol. 104, pp. 86\u201392.","journal-title":"J. Computational Phys."},{"key":"6100_CR55","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. and Scheuer, T., Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulating Annealing, J. Computational Phys., 1990, vol. 90, pp. 161\u2013175.","journal-title":"J. Computational Phys."},{"key":"6100_CR56","doi-asserted-by":"crossref","unstructured":"Rodriguez-Tello, E. and Torres-Jimenez, J., Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three, Proc. of Artificial Evolution 2009, pp. 86\u201397.","DOI":"10.1007\/978-3-642-14156-0_8"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768811030029.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768811030029","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768811030029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768811030029.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:06:56Z","timestamp":1775009216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768811030029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["6100"],"URL":"https:\/\/doi.org\/10.1134\/s0361768811030029","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5]]},"assertion":[{"value":"3 October 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2011","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}