{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T21:40:01Z","timestamp":1751146801469,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T00:00:00Z","timestamp":1513296000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T00:00:00Z","timestamp":1513296000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["1421058"],"award-info":[{"award-number":["1421058"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00373-017-1861-9","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T11:49:06Z","timestamp":1513338546000},"page":"223-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Strength Four Covering Arrays with Three Symbols"],"prefix":"10.1007","volume":"34","author":[{"given":"Soumen","family":"Maity","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasmeen","family":"Akhtar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reshma C.","family":"Chandrasekharan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,15]]},"reference":[{"key":"1861_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-81-322-2452-5_26","volume":"139","author":"Y Akhtar","year":"2015","unstructured":"Akhtar, Y., Maity, S., Chandrasekharan, R.C.: Covering arrays of strength four and software testing. Springer Proc. Math. Stat. 139, 391\u2013398 (2015)","journal-title":"Springer Proc. Math. Stat."},{"key":"1861_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008379710317","volume":"16","author":"MA Chateauneuf","year":"1999","unstructured":"Chateauneuf, M.A., Colbourn, C.J., Kreher, D.L.: Covering arrays of strength three. Designs Codes Cryptogr. 16, 235\u2013242 (1999)","journal-title":"Designs Codes Cryptogr."},{"issue":"4","key":"1861_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"MA Chateauneuf","year":"2002","unstructured":"Chateauneuf, M.A., Kreher, D.L.: On the state of strength-three covering arrays. J. Combin. Design 10(4), 217\u2013238 (2002)","journal-title":"J. Combin. Design"},{"issue":"7","key":"1861_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"DM 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 Trans. Softw. Eng. 23(7), 437\u2013443 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1861_CR5","unstructured":"Colbourn, C.J.: Covering array tables for $$t=2,3,4,5,6$$. http:\/\/www.public.asu.edu\/ccolbou\/src\/tabby\/catable.html . Accessed 17 May 2017"},{"key":"1861_CR6","first-page":"97","volume":"90","author":"CJ Colbourn","year":"2014","unstructured":"Colbourn, C.J.: Conditional expectation algorithms for covering arrays. J. Combin. Math. Combin. Comput. 90, 97\u2013115 (2014)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1861_CR7","unstructured":"Covering Arrays generated by IPOG-F. http:\/\/math.nist.gov\/coveringarrays\/ipof\/ipof-results.html . Accessed 1 May 2017"},{"key":"1861_CR8","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. 284, 149\u2013156 (2004)","journal-title":"Discrete Math."},{"key":"1861_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/0-387-25036-0_10","volume-title":"Software and Hardware Testing Using Combinatorial Covering Suites. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications","author":"A Hartman","year":"2006","unstructured":"Hartman, A.: Software and Hardware Testing Using Combinatorial Covering Suites. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications, vol. 34, pp. 237\u2013266. Kluwer, Dordrecht (2006)"},{"key":"1861_CR10","volume-title":"Testing Computer Software","author":"C Kaner","year":"1999","unstructured":"Kaner, C., Falk, J., Nguyen, H.Q.: Testing Computer Software, 2nd edn. Wiley, New York (1999)","edition":"2"},{"issue":"6","key":"1861_CR11","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"DR Kuhn","year":"2004","unstructured":"Kuhn, D.R., Wallace, D.R., Gallo, A.M.: Software fault interactions and implications for software testing. IEEE Trans. Softw. Eng. 30(6), 418\u2013421 (2004)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"9","key":"1861_CR12","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1587\/transinf.E95.D.2227","volume":"E\u201395\u2013D","author":"S Maity","year":"2012","unstructured":"Maity, S.: 3-Way software testing with budget constraints. IEICE Trans. Inf. Syst. E\u201395\u2013D(9), 2227\u20132231 (2012)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"1861_CR13","doi-asserted-by":"crossref","unstructured":"Maity, S., Nayak, A.: Improved test generation algorithms for pair-wise testing. In: Proceedings of 16th IEEE international symposium on software reliability engineering, Chicago, pp. 235\u2013244 (2005)","DOI":"10.1109\/ISSRE.2005.23"},{"issue":"1","key":"1861_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1002\/jcd.20035","volume":"13","author":"K Meagher","year":"2005","unstructured":"Meagher, K., Stevens, B.: Group construction of covering arrays. J. Combin. Designs 13(1), 70\u201377 (2005)","journal-title":"J. Combin. Designs"},{"issue":"1","key":"1861_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ejc.2012.07.017","volume":"34","author":"P Nayeri","year":"2013","unstructured":"Nayeri, P., Colbourn, C.J., Konjevod, G.: Randomized post-optimization of covering arrays. Eur. J. Combin. 34(1), 91\u2013103 (2013)","journal-title":"Eur. J. Combin."},{"key":"1861_CR16","volume-title":"A Course in the Theory of Groups","author":"DJS Robinson","year":"1995","unstructured":"Robinson, D.J.S.: A Course in the Theory of Groups, 2nd edn. Springer, New York (1995)","edition":"2"},{"issue":"1","key":"1861_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/TSE.2006.8","volume":"32","author":"C Yilmaz","year":"2006","unstructured":"Yilmaz, C., Cohen, M., Porter, A.: Covering arrays for efficient fault characterisation in complex configuration spaces. IEEE Trans. Softw. Eng. 32(1), 20\u201334 (2006)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1861-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1861-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1861-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T21:18:20Z","timestamp":1751145500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1861-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,15]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1861"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1861-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,12,15]]},"assertion":[{"value":"22 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}