{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:54:58Z","timestamp":1778522098556,"version":"3.51.4"},"reference-count":104,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2907057","type":"journal-article","created":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T18:51:06Z","timestamp":1553280666000},"page":"42774-42797","source":"Crossref","is-referenced-by-count":23,"title":["Methods to Construct Uniform Covering Arrays"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5029-5340","authenticated-orcid":false,"given":"Jose","family":"Torres-Jimenez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idelfonso","family":"Izquierdo-Marquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8578-0170","authenticated-orcid":false,"given":"Himer","family":"Avila-George","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.10.040"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9835-2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.10002"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27060-9_13"},{"key":"ref31","first-page":"61","article-title":"A branch and bound algorithm for ternary covering arrays construction using trinomial coefficients","volume":"49","author":"martinez-pena","year":"2010","journal-title":"Res Comput Sci"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676175"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9333-8"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2452-5_26"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.10.026"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20035"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43429-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2014.15"},{"key":"ref29","author":"r\u00e9nyi","year":"1971","journal-title":"Foundations of Probability"},{"key":"ref20","author":"colbourn","year":"2017","journal-title":"Covering Array Tables for T=2 3 4 5 6"},{"key":"ref22","first-page":"125","article-title":"Combinatorial aspects of covering arrays","volume":"59","author":"colbourn","year":"2004","journal-title":"Le Matematiche"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25036-0_10"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1134\/S0361768811030029"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.37236\/571","article-title":"A survey of binary covering arrays","volume":"18","author":"lawrence","year":"2011","journal-title":"Electron J Combinat"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1002\/qre.2176"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1016\/j.trit.2016.12.006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2013.10"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/523\/10309"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1080\/15598608.2012.647489"},{"key":"ref59","first-page":"44","article-title":"Strength two covering arrays construction using a SAT representation","volume":"5317","author":"lopez-escogido","year":"2008","journal-title":"Advances in Artificial Intelligence"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-006-7094-9"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500336"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2008.02.034"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2006.33"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16242-8_9"},{"key":"ref53","first-page":"397","article-title":"A new backtracking algorithm for constructing binary covering arrays of variable strength","volume":"5845","author":"bracho-rios","year":"2009","journal-title":"Advances in Artificial Intelligence"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-014-1519-9"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20067"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.24"},{"key":"ref3","first-page":"91","article-title":"An investigation of the applicability of design of experiments to software testing","author":"kuhn","year":"2002","journal-title":"Proceedings of the 27th Annual NASA Goddard\/IEEE Software Engineering Workshop (SEW- 27 '02)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.50"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SEW.2006.26"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1104\/pp.010683"},{"key":"ref49","first-page":"31","article-title":"Profiles of covering arrays of strength two","volume":"44","author":"colbourn","year":"2013","journal-title":"Computer Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2011.05.041"},{"key":"ref9","first-page":"317","article-title":"Clustering business process models based on multimodal search and covering arrays","author":"ordo\u00f1ez","year":"2016","journal-title":"Advances in Soft Computing"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20065"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/B:DESI.0000029232.40302.6d"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-011-9505-1"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.03.010"},{"key":"ref42","article-title":"k-propriétés dans des tableaux de n colonnes; cas particulier de la k-surjectivité et de la k-permutivité","author":"roux","year":"1987"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0465-6"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-0020-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.06.036"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-1012-x"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.381"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/HASE.1998.731623"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.393"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.26493\/2590-9770.1220.3a1"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201186"},{"key":"ref74","author":"sarkar","year":"2016","journal-title":"Two-stage algorithms for covering array construction"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0369-x"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1049\/iet-sen.2012.0074"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.09.020"},{"key":"ref60","first-page":"51","article-title":"A max-sat-based approach to constructing optimal covering arrays","volume":"256","author":"ans\u00f3tegui","year":"2013","journal-title":"Artificial Intelligence Research and Development"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2000.879426"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/52.536462"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ECBS.2007.47"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.6028\/jres.113.022"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.024"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1504\/IJAIP.2010.029443"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.365"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.466"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1142\/S021853930100058X"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2013.36"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MITP.2008.54"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.03.021"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.71"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/897027"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2015.05.005"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.14257\/ijhit.2015.8.9.13"},{"key":"ref104","article-title":"Construcción de covering arrays mixtos usando una generalización del operador de fusión","author":"rodriguez-cristerna","year":"2012"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2362532"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.07.050"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1002\/qre.2129"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2008.05.020"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2012.07.017"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1860673"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.05.047"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018457"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90098-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729387"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1201\/CHDISMTHAPP"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90054-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.03.008"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00291-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.06.013"},{"key":"ref81","article-title":"Metaheuristics and the search for covering and packing arrays","author":"stardom","year":"2001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.21553"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14156-0_8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/16M1067767"},{"key":"ref83","article-title":"Mixed covering arrays on graphs and tabu search algorithms","author":"zekaoui","year":"2006"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586148"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.11.029"},{"key":"ref85","first-page":"72","article-title":"Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing","author":"shiba","year":"2004","journal-title":"Proc 28th Annu Int Comput Softw Appl Conf (COMPSAC)"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-016-1635-5"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2009.18"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.07.029"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08672909.pdf?arnumber=8672909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T06:31:53Z","timestamp":1663137113000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8672909\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":104,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2907057","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}