{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:05:54Z","timestamp":1778850354263,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,4,18]],"date-time":"2012-04-18T00:00:00Z","timestamp":1334707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s11227-012-0763-0","type":"journal-article","created":{"date-parts":[[2012,4,17]],"date-time":"2012-04-17T12:21:47Z","timestamp":1334665307000},"page":"916-945","source":"Crossref","is-referenced-by-count":9,"title":["Supercomputing and grid computing on the verification of covering arrays"],"prefix":"10.1007","volume":"62","author":[{"given":"Himer","family":"Avila-George","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Torres-Jimenez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Rangel-Valdez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abel","family":"Carri\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vicente","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,18]]},"reference":[{"key":"763_CR1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-642-15108-8_10","volume-title":"Proceedings of the 3rd international conference on data management in grid and peer-to-peer systems","author":"H Avila-George","year":"2010","unstructured":"Avila-George\u00a0H, Torres-Jimenez\u00a0J, Hern\u00e1ndez\u00a0V, Rangel-Valdez\u00a0N (2010) Verification of general and cyclic covering arrays using Grid computing. In: Proceedings of the 3rd international conference on data management in grid and peer-to-peer systems, GLOBE 2010, Bilbao, Spain, 30\u00a0August\u20133\u00a0September. Lecture notes in computer science, vol 6265. Springer, Berlin, pp\u00a0112\u2013123. doi: 10.1007\/978-3-642-15108-8_10"},{"issue":"3","key":"763_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/stvr.365","volume":"17","author":"RC Bryce","year":"2007","unstructured":"Bryce\u00a0RC, Colbourn\u00a0CJ (2007) The density algorithm for pairwise interaction testing. Softw Test Verif Reliab 17(3):159\u2013182. doi: 10.1002\/stvr.365","journal-title":"Softw Test Verif Reliab"},{"key":"763_CR3","first-page":"503","volume-title":"Proceedings of the international conference on software testing, analysis, and review\u2014STAR","author":"K Burr","year":"1998","unstructured":"Burr\u00a0K, Young\u00a0W (1998) Combinatorial test techniques: table-based automation, test generation and code coverage. In: Proceedings of the international conference on software testing, analysis, and review\u2014STAR, pp\u00a0503\u2013513. West, 1998"},{"issue":"3","key":"763_CR4","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush\u00a0KA (1952) Orthogonal arrays of index unity. Ann Math Stat 23(3):426\u2013434. doi: 10.1214\/aoms\/1177729387","journal-title":"Ann Math Stat"},{"key":"763_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/WETICE.2009.52","volume-title":"Proceedings of the 18th IEEE international workshops on enabling technologies: infrastructures for collaborative enterprises\u2014WETICE 2009","author":"A Calvagna","year":"2009","unstructured":"Calvagna\u00a0A, Gargantini\u00a0A, Tramontana\u00a0E (2009) Building T-wise combinatorial interaction test suites by means of grid computing. In: Proceedings of the 18th IEEE international workshops on enabling technologies: infrastructures for collaborative enterprises\u2014WETICE 2009. IEEE Comput Soc, Los Alamitos, pp\u00a0213\u2013218. doi: 10.1109\/WETICE.2009.52"},{"key":"763_CR6","volume-title":"Experimental design for combinatorial and high throughput materials development","author":"JN Cawse","year":"2003","unstructured":"Cawse\u00a0JN (2003) Experimental design for combinatorial and high throughput materials development. Wiley, New York"},{"key":"763_CR7","doi-asserted-by":"crossref","first-page":"1943","DOI":"10.1016\/j.dam.2007.04.010","volume":"155","author":"C Cheng","year":"2007","unstructured":"Cheng\u00a0C (2007) The test suite generation problem: optimal instances and their implications. Discrete Appl Math 155:1943\u20131957. doi: 10.1016\/j.dam.2007.04.010","journal-title":"Discrete Appl Math"},{"issue":"5","key":"763_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"DM Cohen","year":"1996","unstructured":"Cohen\u00a0DM, Dalal\u00a0SR, Parelius\u00a0J, Patton\u00a0GC (1996) The combinatorial design approach to automatic test generation. IEEE Softw 13(5):83\u201388. doi: 10.1109\/52.536462","journal-title":"IEEE Softw"},{"key":"763_CR9","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/ISSRE.2003.1251061","volume-title":"Proceedings of the 14th international symposium on software reliability engineering\u2014ISSRE 2003","author":"MB Cohen","year":"2003","unstructured":"Cohen\u00a0MB, Colbourn\u00a0CJ, Ling\u00a0ACH (2003) Augmenting simulated annealing to build interaction test suites. In: Proceedings of the 14th international symposium on software reliability engineering\u2014ISSRE 2003. IEEE Comput Soc, Los Alamitos, pp\u00a0394\u2013405. http:\/\/doi.ieeecomputersociety.org\/10.1109\/ISSRE.2003.1251061"},{"issue":"1, 2","key":"763_CR10","first-page":"125","volume":"59","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn\u00a0CJ (2004) Combinatorial aspects of covering arrays. Matematiche 59(1, 2):125\u2013172","journal-title":"Matematiche"},{"key":"763_CR11","unstructured":"Colbourn\u00a0CJ (2011) Covering array tables for t=2,3,4,5,6. URL: http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/catable.html . Accessed on April\u00a020"},{"key":"763_CR12","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/978-3-642-01877-0_3","volume-title":"Proceedings of the 2nd international workshop on coding and cryptology\u2014IWCC 2009","author":"CJ Colbourn","year":"2009","unstructured":"Colbourn\u00a0CJ, K\u00e9ri\u00a0G (2009) Binary covering arrays and existentially closed graphs. In: Proceedings of the 2nd international workshop on coding and cryptology\u2014IWCC 2009. Lecture notes in computer science, vol 5557. Springer, Berlin, pp\u00a022\u201333. doi: 10.1007\/978-3-642-01877-0_3"},{"issue":"4","key":"763_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1515\/JMC.2009.018","volume":"3","author":"CJ Colbourn","year":"2009","unstructured":"Colbourn\u00a0CJ, Ling\u00a0ACH (2009) A recursive construction for perfect hash families. J Math Cryptol 3(4):291\u2013306. doi: 10.1515\/JMC.2009.018","journal-title":"J Math Cryptol"},{"issue":"2","key":"763_CR14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1002\/jcd.20065","volume":"12","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn\u00a0CJ, Martirosyan\u00a0SS, Mullen\u00a0GL, Shasha\u00a0D, Sherwood\u00a0GB, Yucas\u00a0JL (2006) Products of mixed covering arrays of strength two. J Comb Des 12(2):124\u2013138. doi: 10.1002\/jcd.20065","journal-title":"J Comb Des"},{"key":"763_CR15","series-title":"Contemporary mathematics","isbn-type":"print","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1090\/conm\/523\/10309","volume-title":"Error-correcting codes, finite geometries and cryptography","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn\u00a0CJ, Torres-Jimenez\u00a0J (2010) Heterogeneous hash families and covering arrays. In: Error-correcting codes, finite geometries and cryptography. Contemporary mathematics, vol\u00a0523. pp\u00a03\u201315. ISBN-10 0-8218-4956-5","ISBN":"https:\/\/id.crossref.org\/isbn\/0821849565"},{"key":"763_CR16","unstructured":"DIANE (2011) Distributed analysis environment. URL: http:\/\/it-proj-diane.web.cern.ch\/it-proj-diane\/ . Accessed on June\u00a06"},{"key":"763_CR17","volume-title":"The grid: blueprint for a new computing infrastructure","author":"I Foster","year":"1999","unstructured":"Foster\u00a0I, Kesselman\u00a0C (1999) The grid: blueprint for a new computing infrastructure. Morgan Kaufmann, San Mateo"},{"key":"763_CR18","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"NBG Seroussi","year":"1988","unstructured":"Seroussi\u00a0NBG (1988) Vector sets for exhaustive testing of logic circuits. IEEE Trans Inf Theory 34:513\u2013522","journal-title":"IEEE Trans Inf Theory"},{"key":"763_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-642-17458-2_6","volume-title":"Proceedings of the 4th international conference on combinatorial optimization and applications","author":"L Gonzalez-Hernandez","year":"2010","unstructured":"Gonzalez-Hernandez\u00a0L, Rangel-Valdez\u00a0N, Torres-Jimenez\u00a0J (2010) Construction of mixed covering arrays of variable strength using a tabu search approach. In: Proceedings of the 4th international conference on combinatorial optimization and applications, COCOA, 2010. Lecture notes in computer science, vol 6508. Springer, Berlin, pp\u00a051\u201364. doi: 10.1007\/978-3-642-17458-2_6"},{"key":"763_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal arrays: theory and applications","author":"AS Hedayat","year":"1999","unstructured":"Hedayat\u00a0AS, Sloane\u00a0NJA, Stufken\u00a0J (1999) Orthogonal arrays: theory and applications. Springer, Berlin"},{"issue":"1\u20132","key":"763_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02018457","volume":"3","author":"GOH Katona","year":"1973","unstructured":"Katona\u00a0GOH (1973) Two applications (for search theory and truth functions) of Sperner type theorems. Period Math Hung 3(1\u20132):19\u201326. doi: 10.1007\/BF02018457","journal-title":"Period Math Hung"},{"issue":"3","key":"763_CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"DJ Kleitman","year":"1973","unstructured":"Kleitman\u00a0DJ, Spencer\u00a0J (1973) Families of k-independent sets. Discrete Math 6(3):255\u2013262. doi: 10.1016\/0012-365X(73)90098-8","journal-title":"Discrete Math"},{"issue":"3","key":"763_CR23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/MITP.2008.54","volume":"10","author":"R Kuhn","year":"2008","unstructured":"Kuhn\u00a0R, Lei\u00a0Y, Kacker\u00a0R (2008) Practical combinatorial testing: beyond pairwise. IT Prof 10(3):19\u201323. doi: 10.1109\/MITP.2008.54","journal-title":"IT Prof"},{"issue":"1","key":"763_CR24","doi-asserted-by":"crossref","first-page":"84","DOI":"10.37236\/571","volume":"18","author":"J Lawrence","year":"2011","unstructured":"Lawrence\u00a0J, Kacker\u00a0R, Lei\u00a0Y, Kuhn\u00a0D, Forbes\u00a0M (2011) A survey of binary covering arrays. Electron J Comb 18(1):84","journal-title":"Electron J Comb"},{"key":"763_CR25","first-page":"549","volume-title":"Proceedings of the 14th annual IEEE international conference and workshops on the engineering of computer-based systems\u2014ECBS 2007","author":"Y Lei","year":"2007","unstructured":"Lei\u00a0Y, Kacker\u00a0R, Kuhn\u00a0DR, Okun\u00a0V, Lawrence\u00a0J (2007) IPOG: a general strategy for t-way software testing. In: Proceedings of the 14th annual IEEE international conference and workshops on the engineering of computer-based systems\u2014ECBS 2007. IEEE Comput Soc, Los Alamitos, pp\u00a0549\u2013556. doi: 10.1109\/ECBS.2007.47"},{"key":"763_CR26","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/978-3-642-16952-6_58","volume-title":"Proceedings of the 12th Ibero-American conference on artificial intelligence\u2014IBERAMIA 2010","author":"J Martinez-Pena","year":"2010","unstructured":"Martinez-Pena\u00a0J, Torres-Jimenez\u00a0J, Rangel-Valdez\u00a0N, Avila-George\u00a0H (2010) A heuristic approach for constructing ternary covering arrays using trinomial coefficients. In: Proceedings of the 12th Ibero-American conference on artificial intelligence\u2014IBERAMIA 2010. Lecture notes in computer science, vol 6433. Springer, Berlin, pp\u00a0572\u2013581. doi: 10.1007\/978-3-642-16952-6_58"},{"key":"763_CR27","first-page":"266","volume":"74","author":"SS Martirosyan","year":"2005","unstructured":"Martirosyan\u00a0SS, Colbourn\u00a0CJ (2005) Recursive constructions of covering arrays. Bayreuth Math Schr 74:266\u2013275","journal-title":"Bayreuth Math Schr"},{"key":"763_CR28","unstructured":"McDowell\u00a0AG (2011) All-pairs testing. URL: http:\/\/www.mcdowella.demon.co.uk\/allPairs.html . Accessed on June\u00a021"},{"issue":"11","key":"763_CR29","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1016\/j.cpc.2009.06.016","volume":"180","author":"J Moscicki","year":"2009","unstructured":"Moscicki\u00a0J, Brochu\u00a0F, Ebke\u00a0J, Egede\u00a0U, Elmsheuser\u00a0J, Harrison\u00a0K, Jones\u00a0R, Lee\u00a0H, Liko\u00a0D, Maier\u00a0A, Muraru\u00a0A, Patrick\u00a0G, Pajchel\u00a0K, Reece\u00a0W, Samset\u00a0B, Slater\u00a0M, Soroko\u00a0A, Tan\u00a0C, van\u00a0der Ster\u00a0D, Williams\u00a0M (2009) Ganga: a tool for computational-task management and easy access to grid resources. Comput Phys Commun 180(11):2303\u20132316. doi: 10.1016\/j.cpc.2009.06.016","journal-title":"Comput Phys Commun"},{"issue":"6","key":"763_CR30","first-page":"413","volume":"11","author":"L Moura","year":"2003","unstructured":"Moura\u00a0L, Stardom\u00a0J, Stevens\u00a0B, Williams\u00a0A (2003) Covering arrays with mixed alphabet sizes. J\u00a0Comb Des 11(6):413\u2013432. doi: 10.1002\/jcd.10059","journal-title":"J\u00a0Comb Des"},{"key":"763_CR31","unstructured":"National Institute of Standards and Technology (2011) NIST covering array tables. URL: http:\/\/math.nist.gov\/coveringarrays\/ . Accessed on April\u00a020"},{"key":"763_CR32","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(03)00291-9","volume":"138","author":"KJ Nurmela","year":"2004","unstructured":"Nurmela\u00a0KJ (2004) Upper bounds for covering arrays by tabu search. Discrete Appl Math 138:143\u2013152. doi: 10.1016\/S0166-218X(03)00291-9","journal-title":"Discrete Appl Math"},{"key":"763_CR33","unstructured":"Pacini\u00a0F (2011) Job description language howto. URL: http:\/\/server11.infn.it\/workload-grid\/docs\/DataGrid-01-TEN-0102-0_2-Document.pdf . Accessed on October\u00a010"},{"key":"763_CR34","volume-title":"Quality engineering using robust design","author":"MS Phadke","year":"1995","unstructured":"Phadke\u00a0MS (1995) Quality engineering using robust design. Prentice Hall, New York"},{"key":"763_CR35","volume-title":"Foundations of probability","author":"A R\u00e9nyi","year":"1971","unstructured":"R\u00e9nyi\u00a0A (1971) Foundations of probability. Wiley, New York"},{"issue":"4","key":"763_CR36","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1104\/pp.010683","volume":"127","author":"DE Shasha","year":"2001","unstructured":"Shasha\u00a0DE, Kouranov\u00a0AY, Lejay\u00a0LV, Chou\u00a0MF, Coruzzi\u00a0GM (2001) Using combinatorial design to study regulation by multiple input signals: a tool for parsimony in the post-genomics era. Plant Physiol 127(4):1590\u20131594. doi: 10.1104\/pp.010683","journal-title":"Plant Physiol"},{"issue":"24","key":"763_CR37","doi-asserted-by":"crossref","first-page":"6022","DOI":"10.1016\/j.disc.2007.11.021","volume":"308","author":"GB Sherwood","year":"2008","unstructured":"Sherwood\u00a0GB (2008) Optimal and near-optimal mixed covering arrays by column expansion. Discrete Math 308(24):6022\u20136035. doi: 10.1016\/j.disc.2007.11.021","journal-title":"Discrete Math"},{"key":"763_CR38","unstructured":"Sherwood\u00a0GB (2011) On the construction of orthogonal arrays and covering arrays using permutation groups. URL: http:\/\/testcover.com\/pub\/background\/cover.htm . Accessed on June\u00a020"},{"key":"763_CR39","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/CMPSAC.2004.1342808","volume-title":"Proceedings of the 28th annual international computer software and applications conference, vol\u00a001, COMPSAC 2004","author":"T Shiba","year":"2004","unstructured":"Shiba\u00a0T, Tsuchiya\u00a0T, Kikuno\u00a0T (2004) Using artificial life techniques to generate test cases for combinatorial testing. In: Proceedings of the 28th annual international computer software and applications conference, vol\u00a001, COMPSAC 2004. IEEE Comput Soc, Los Alamitos, pp\u00a072\u201377. doi: 10.1109\/CMPSAC.2004.1342808"},{"key":"763_CR40","isbn-type":"print","first-page":"71","volume-title":"Cryptography","author":"J Torres-Jimenez","year":"2012","unstructured":"Torres-Jimenez\u00a0J, Avila-George\u00a0H, Rangel-Valdez\u00a0N, Gonzalez-Hernandez\u00a0L (2012) Construction of orthogonal arrays of index unity using logarithm tables for galois fields. In Cryptography. InTech, pp\u00a071\u201390. ISBN 978-953-51-0179-6","ISBN":"https:\/\/id.crossref.org\/isbn\/9789535101"},{"key":"763_CR41","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-540-30176-9_31","volume-title":"Proceedings of the second Asian applied computing conference\u2014AACC 2004","author":"J Torres-Jimenez","year":"2004","unstructured":"Torres-Jimenez\u00a0J, De Alfonso\u00a0C, Hern\u00e1ndez\u00a0V (2004) Computation of ternary covering arrays using a grid. In: Proceedings of the second Asian applied computing conference\u2014AACC 2004. Lecture notes in computer science, vol 3285. Springer, Berlin, pp\u00a0240\u2013246. doi: 10.1007\/978-3-540-30176-9_31"},{"issue":"1","key":"763_CR42","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/0020739X.2010.510215","volume":"42","author":"J Torres-Jimenez","year":"2010","unstructured":"Torres-Jimenez\u00a0J, Rangel-Valdez\u00a0N, Gonzalez-Hernandez\u00a0AL, Avila-George\u00a0H (2010) Construction of logarithm tables for Galois fields. Int J Math Educ Sci Technol 42(1):91\u2013102. doi: 10.1080\/0020739X.2010.510215","journal-title":"Int J Math Educ Sci Technol"},{"issue":"1","key":"763_CR43","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ins.2011.09.020","volume":"185","author":"J Torres-Jimenez","year":"2012","unstructured":"Torres-Jimenez\u00a0J, Rodriguez-Tello\u00a0E (2012) New bounds for binary covering arrays using simulated annealing. Inf Sci 185(1):137\u2013152. doi: 10.1016\/j.ins.2011.09.020","journal-title":"Inf Sci"},{"key":"763_CR44","first-page":"431","volume-title":"Proceedings of the IEEE aerospace conference","author":"Y Tung","year":"2000","unstructured":"Tung\u00a0Y, Aldiwan\u00a0WS (2000) Automating test case generation for the new generation mission software system. In: Proceedings of the IEEE aerospace conference, vol\u00a01. IEEE Press, New York, pp\u00a0431\u2013437. doi: 10.1109\/AERO.2000.879426"},{"issue":"7","key":"763_CR45","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1109\/JSAC.2004.829351","volume":"22","author":"K Vadde","year":"2004","unstructured":"Vadde\u00a0K, Syrotiuk\u00a0V (2004) Factor interaction on service delivery in mobile ad hoc networks. IEEE J Sel Areas Commun 22(7):1335\u20131346. doi: 10.1109\/JSAC.2004.829351","journal-title":"IEEE J Sel Areas Commun"},{"key":"763_CR46","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-0-387-35516-0_4","volume-title":"Proceedings of the IFIP TC6\/WG6.1 13th International conference on testing communicating systems: tools and techniques\u2014TestCom","author":"AW Williams","year":"2000","unstructured":"Williams\u00a0AW (2000) Determination of test configurations for pair-wise interaction coverage. In: Proceedings of the IFIP TC6\/WG6.1 13th International conference on testing communicating systems: tools and techniques\u2014TestCom. Kluwer, Norwell, pp\u00a059\u201374"},{"key":"763_CR47","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/ISSRE.1996.558835","volume-title":"Proceedings of the seventh international symposium on software reliability engineering\u2014ISSRE","author":"AW Williams","year":"1996","unstructured":"Williams\u00a0AW, Probert\u00a0RL (1996) A practical strategy for testing pair-wise coverage of network interfaces. In: Proceedings of the seventh international symposium on software reliability engineering\u2014ISSRE. IEEE Comput Soc, Los Alamitos, pp\u00a0246\u2013256. doi: 10.1109\/ISSRE.1996.558835"},{"issue":"1","key":"763_CR48","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/TSE.2006.8","volume":"32","author":"C Yilmaz","year":"2006","unstructured":"Yilmaz\u00a0C, Cohen\u00a0MB, Porter\u00a0AA (2006) Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Trans Softw Eng 32(1):20\u201334. doi: 10.1109\/TSE.2006.8","journal-title":"IEEE Trans Softw Eng"},{"key":"763_CR49","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/ICDFMA.2008.4784416","volume-title":"First international conference on distributed framework and applications\u2014DFmA 2008","author":"M Younis","year":"2008","unstructured":"Younis\u00a0M, Zamli\u00a0K, Isa\u00a0N (2008) A strategy for grid based t-way test data generation. In: First international conference on distributed framework and applications\u2014DFmA 2008, pp\u00a073\u201378. doi: 10.1109\/ICDFMA.2008.4784416"}],"updated-by":[{"DOI":"10.1007\/s11227-015-1389-9","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2015,2,19]],"date-time":"2015-02-19T00:00:00Z","timestamp":1424304000000}}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0763-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-012-0763-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0763-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:01:42Z","timestamp":1742943702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-012-0763-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,18]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["763"],"URL":"https:\/\/doi.org\/10.1007\/s11227-012-0763-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,18]]}}}