{"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":1778522100138,"version":"3.51.4"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T00:00:00Z","timestamp":1537401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s11786-018-0385-x","type":"journal-article","created":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T04:38:01Z","timestamp":1537418281000},"page":"429-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On a Combinatorial Framework for Fault Characterization"],"prefix":"10.1007","volume":"12","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Violet R.","family":"Syrotiuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"1","key":"385_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2723872.2723878","volume":"49","author":"AN Aldaco","year":"2015","unstructured":"Aldaco, A.N., Colbourn, C.J., Syrotiuk, V.R.: Locating arrays: a new experimental design for screening complex engineered systems. SIGOPS Oper. Syst. Rev. 49(1), 31\u201340 (2015)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"385_CR2","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 3rd edn. Wiley, Hoboken (2008)","edition":"3"},{"key":"385_CR3","unstructured":"Bach, J., Schroeder, P.J.: Pairwise testing: a best practice that isn\u2019t. In: 22nd Annual Pacific Northwest Software Quality Conference, pp. 180\u2013196 (2004)"},{"issue":"30","key":"385_CR4","doi-asserted-by":"publisher","first-page":"E2752","DOI":"10.1073\/pnas.1216318110","volume":"110","author":"E Berg van den","year":"2013","unstructured":"van den Berg, E., Cand\u00e8s, E., Chinn, G., Levin, C., Olcott, P.D., Sing-Long, C.: Single-photon sampling architecture for solid-state imaging sensors. Proc. Natl. Acad. Sci. 110(30), E2752\u2013E2761 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"385_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/stvr.393","volume":"19","author":"RC Bryce","year":"2009","unstructured":"Bryce, R.C., Colbourn, C.J.: A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verif. Reliab. 19, 37\u201353 (2009)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"385_CR6","first-page":"87","volume":"86","author":"RC Bryce","year":"2013","unstructured":"Bryce, R.C., Colbourn, C.J.: Expected time to detection of interaction faults. J. Comb. Math. Comb. Comput. 86, 87\u2013110 (2013)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"385_CR7","doi-asserted-by":"crossref","unstructured":"Bryce, R.C., Colbourn, C.J., Kuhn, D.R.: Finding interaction faults adaptively using distance-based strategies. In: 2011 18th IEEE International Conference and Workshops on Engineering of Computer Based Systems (ECBS), pp. 4\u201313 (2011)","DOI":"10.1109\/ECBS.2011.9"},{"key":"385_CR8","first-page":"115","volume":"9925","author":"NH Bshouty","year":"2016","unstructured":"Bshouty, N.H., Costa, A.: Exact learning of juntas from membership queries. Lect. Notes Artif. Intell. 9925, 115\u2013129 (2016)","journal-title":"Lect. Notes Artif. Intell."},{"key":"385_CR9","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, J., Ghandehari, L.S., Lei, Y., Kacker, R., Kuhn, D.R.: Evaluating the effectiveness of BEN in localizing different types of software fault. In: 2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 26\u201334 (2016)","DOI":"10.1109\/ICSTW.2016.44"},{"issue":"1","key":"385_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"385_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jss.2009.02.022","volume":"83","author":"TY Chen","year":"2010","unstructured":"Chen, T.Y., Kuo, F.C., Merkel, R.G., Tse, T.: Adaptive random testing: the art of test case diversity. J. Syst. Softw. 83(1), 60\u201366 (2010)","journal-title":"J. Syst. Softw."},{"key":"385_CR12","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-30502-6_23","volume-title":"Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making","author":"T. Y. Chen","year":"2004","unstructured":"Chen, T.Y., Leung, H., Mak, I.K.: Adaptive random testing. In: 9th Asian Computing Science Conference Advances in Computer Science\u2014ASIAN 2004, Higher-Level Decision Making, pp. 320\u2013329 (2004)"},{"issue":"4","key":"385_CR13","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1093\/biomet\/88.4.1169","volume":"88","author":"CS Cheng","year":"2001","unstructured":"Cheng, C.S., Tang, B.: Upper bounds on the number of columns in supersaturated designs. Biometrika 88(4), 1169\u20131174 (2001)","journal-title":"Biometrika"},{"key":"385_CR14","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, 437\u201344 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"385_CR15","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TSE.2008.50","volume":"34","author":"MB Cohen","year":"2008","unstructured":"Cohen, M.B., Dwyer, M.B., Shi, J.: Constructing interaction test suites for highly-configurable systems in the presence of constraints: a greedy approach. IEEE Trans. Softw. Eng. 34, 633\u2013650 (2008)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"385_CR16","first-page":"125","volume":"3","author":"CJ Colbourn","year":"2016","unstructured":"Colbourn, C.J., Fan, B.: Locating one pairwise interaction: three recursive constructions. J. Algebra Comb. Discrete Struct. Appl. 3, 125\u2013134 (2016)","journal-title":"J. Algebra Comb. Discrete Struct. Appl."},{"key":"385_CR17","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1137\/16M1056390","volume":"30","author":"CJ Colbourn","year":"2016","unstructured":"Colbourn, C.J., Fan, B., Horsley, D.: Disjoint spread systems and fault location. SIAM J. Discrete Math. 30, 2011\u20132016 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"385_CR18","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s10623-017-0369-x","volume":"86","author":"CJ Colbourn","year":"2018","unstructured":"Colbourn, C.J., Lanus, E., Sarkar, K.: Asymptotic and constructive methods for covering perfect hash families and covering arrays. Designs Codes Cryptogr. 86, 907\u2013937 (2018)","journal-title":"Designs Codes Cryptogr."},{"key":"385_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10878-007-9082-4","volume":"15","author":"CJ Colbourn","year":"2008","unstructured":"Colbourn, C.J., McClary, D.W.: Locating and detecting arrays for interaction faults. J. Comb. Optim. 15, 17\u201348 (2008)","journal-title":"J. Comb. Optim."},{"key":"385_CR20","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Syrotiuk, V.R.: Coverage, location, detection, and measurement. In: 2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 19\u201325. IEEE Press (2016)","DOI":"10.1109\/ICSTW.2016.38"},{"key":"385_CR21","doi-asserted-by":"crossref","unstructured":"Compton, R., Mehari, M.T., Colbourn, C.J., De Poorter, E., Syrotiuk, V.R.: Screening interacting factors in a wireless network testbed using locating arrays. In: IEEE INFOCOM International Workshop on Computer and Networking Experimental Research Using Testbeds (CNERT) (2016)","DOI":"10.1109\/INFCOMW.2016.7562157"},{"key":"385_CR22","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1080\/00401706.1998.10485524","volume":"40","author":"SR Dalal","year":"1998","unstructured":"Dalal, S.R., Mallows, C.L.: Factor-covering designs for testing software. Technometrics 40, 234\u2013243 (1998)","journal-title":"Technometrics"},{"key":"385_CR23","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1007616604496","volume":"41","author":"P Damaschke","year":"2000","unstructured":"Damaschke, P.: Adaptive versus nonadaptive attribute-efficient learning. Mach. Learn. 41, 197\u2013215 (2000)","journal-title":"Mach. Learn."},{"key":"385_CR24","doi-asserted-by":"publisher","first-page":"2845","DOI":"10.1109\/18.959265","volume":"47","author":"DL Donoho","year":"2001","unstructured":"Donoho, D.L., Huo, X.: Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inf. Theory 47, 2845\u20132862 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"385_CR25","volume-title":"Combinatorial Group Testing and Its Applications","author":"DZ Du","year":"2000","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications, 2nd edn. World Scientific Publishing Co., Inc., River Edge (2000)","edition":"2"},{"key":"385_CR26","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Infinite and finite sets (Colloq., Keszthely, 1973 Vol. II, pp. 609\u2013627. Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10. North-Holland, Amsterdam (1975)"},{"key":"385_CR27","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/jcd.21553","volume":"25","author":"N Franceti\u0107","year":"2017","unstructured":"Franceti\u0107, N., Stevens, B.: Asymptotic size of covering arrays: an application of entropy compression. J. Comb. Des 25, 243\u2013257 (2017)","journal-title":"J. Comb. Des"},{"issue":"8","key":"385_CR28","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/32.707695","volume":"24","author":"PG Frankl","year":"1998","unstructured":"Frankl, P.G., Hamlet, R.G., Littlewood, B., Strigini, L.: Evaluating testing methods by delivered reliability. IEEE Trans. Softw. Eng. 24(8), 586\u2013601 (1998)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"385_CR29","doi-asserted-by":"crossref","unstructured":"Ghandehari, L.S., Chandrasekaran, J., Lei, Y., Kacker, R., Kuhn, D.R.: BEN: a combinatorial testing-based fault localization tool. In: 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 1\u20134 (2015)","DOI":"10.1109\/ICSTW.2015.7107446"},{"key":"385_CR30","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Shirakura, T., Srivastava, J.N.: Model identification using search linear models and search designs. In: Entropy, search, complexity, Bolyai Soc. Math. Stud., vol.\u00a016, pp. 85\u2013112. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-32777-6_4"},{"key":"385_CR31","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1017\/S0963548300001905","volume":"5","author":"AP Godbole","year":"1996","unstructured":"Godbole, A.P., Skipper, D.E., Sunley, R.A.: $$t$$ t -covering arrays: upper bounds and Poisson approximations. Comb. Probab. Comput. 5, 105\u2013118 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"385_CR32","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/stvr.319","volume":"5","author":"M Grindal","year":"2005","unstructured":"Grindal, M., Offutt, J., Andler, S.F.: Combination testing strategies\u2014a survey. Softw. Test. Verif. Reliab. 5, 167\u2013199 (2005)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"12","key":"385_CR33","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1109\/32.62448","volume":"16","author":"D Hamlet","year":"1990","unstructured":"Hamlet, D., Taylor, R.: Partition testing does not inspire confidence (program testing). IEEE Trans. Softw. Eng. 16(12), 1402\u20131411 (1990)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"385_CR34","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/0-387-25036-0_10","volume-title":"Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms","author":"A Hartman","year":"2005","unstructured":"Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Golumbic, M.C., Hartman, I.B.A. (eds.) Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, pp. 237\u2013266. Springer, Norwell (2005)"},{"key":"385_CR35","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":"385_CR36","unstructured":"Jin, H., Tsuchiya, T.: Constrained locating arrays for combinatorial interaction testing. CoRR arXiv:1801.06041 (2018)"},{"key":"385_CR37","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"issue":"508","key":"385_CR38","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1080\/01621459.2014.938810","volume":"109","author":"B Jones","year":"2014","unstructured":"Jones, B., Majumdar, D.: Optimal supersaturated designs. J. Am. Stat. Assoc. 109(508), 1592\u20131600 (2014)","journal-title":"J. Am. Stat. Assoc."},{"key":"385_CR39","unstructured":"Konishi, T., Kojima, H., Nakagawa, H., Tsuchiya, T.: Finding minimum locating arrays using a SAT solver. In: 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops, ICST Workshops 2017, Tokyo, Japan, March 13\u201317, 2017, pp. 276\u2013277 (2017)"},{"key":"385_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/bs.adcom.2015.05.003","volume":"99","author":"DR Kuhn","year":"2015","unstructured":"Kuhn, D.R., Bryce, R.C., Duan, F., Ghandehari, L.S.G., Lei, Y., Kacker, R.N.: Combinatorial testing: theory and practice. Adv. Comput. 99, 1\u201366 (2015)","journal-title":"Adv. Comput."},{"key":"385_CR41","volume-title":"Introduction to Combinatorial Testing","author":"DR Kuhn","year":"2013","unstructured":"Kuhn, D.R., Kacker, R., Lei, Y.: Introduction to Combinatorial Testing. CRC Press, Boca Raton (2013)"},{"key":"385_CR42","unstructured":"Kuhn, D.R., Kacker, R., Lei, Y.: Combinatorial coverage as an aspect of test quality. Crosstalk pp. 19\u201323 (2015)"},{"key":"385_CR43","unstructured":"Kuhn, D.R., Mendoza, I.D., Kacker, R., Lei, Y.: Combinatorial coverage measurement concepts and applications. In: Sixth IEEE International Conference on Software Testing, Verification and Validation, ICST 2013 Workshops Proceedings, Luxembourg, Luxembourg, March 18\u201322, 2013, pp. 352\u2013361 (2013)"},{"key":"385_CR44","unstructured":"Kuhn, D.R., Reilly, M.: An investigation of the applicability of design of experiments to software testing. In: Proceedings of 27th Annual NASA Goddard\/IEEE Software Engineering Workshop, pp. 91\u201395. IEEE, Los Alamitos, CA (2002)"},{"key":"385_CR45","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, 418\u2013421 (2004)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"7","key":"385_CR46","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jcd.21330","volume":"21","author":"PC Li","year":"2013","unstructured":"Li, P.C., Meagher, K.: Sperner partition systems. J. Comb. Des. 21(7), 267\u2013279 (2013)","journal-title":"J. Comb. Des."},{"issue":"4","key":"385_CR47","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13(4), 383\u2013390 (1975)","journal-title":"Discrete Math."},{"issue":"4","key":"385_CR48","doi-asserted-by":"publisher","first-page":"1776","DOI":"10.1137\/080730706","volume":"23","author":"Conrado Mart\u00ednez","year":"2010","unstructured":"Mart\u00ednez, C., Moura, L., Panario, D., Stevens, B.: Locating errors using ELAs, covering arrays, and adaptive testing algorithms. SIAM J. Discrete Math. 23, 1776\u20131799 (2009-2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"385_CR49","doi-asserted-by":"crossref","unstructured":"Meagher, K., Moura, L., Stevens, B.: A Sperner-type theorem for set-partition systems. Electron. J. Combin. 12, Note 20 (electronic) (2005)","DOI":"10.37236\/1987"},{"key":"385_CR50","volume-title":"Design and Analysis of Experiments","author":"DC Montgomery","year":"2012","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, 8th edn. Wiley, New York (2012)","edition":"8"},{"issue":"2","key":"385_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667053.1667060","volume":"57","author":"Robin A. Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM 57(2), Art. 11, 15 (2010)","journal-title":"Journal of the ACM"},{"key":"385_CR52","unstructured":"Nagamoto, T., Kojima, H., Nakagawa, H., Tsuchiya, T.: Locating a faulty interaction in pair-wise testing. In: 20th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2014, Singapore, November 18\u201321, 2014, pp. 155\u2013156 (2014)"},{"key":"385_CR53","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 postoptimization of covering arrays. Eur. J. Comb. 34, 91\u2013103 (2013)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"385_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1883612.1883618","volume":"43","author":"Changhai Nie","year":"2011","unstructured":"Nie, C., Leung, H.: A survey of combinatorial testing. ACM Comput. Surv. 43(2), #11 (2011)","journal-title":"ACM Computing Surveys"},{"key":"385_CR55","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.infsof.2015.02.008","volume":"62","author":"C Nie","year":"2015","unstructured":"Nie, C., Wu, H., Niu, X., Kuo, F., Leung, H.K.N., Colbourn, C.J.: Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures. Inf. Softw. Technol. 62, 198\u2013213 (2015)","journal-title":"Inf. Softw. Technol."},{"key":"385_CR56","doi-asserted-by":"crossref","unstructured":"Petke, J.: Constraints: The future of combinatorial interaction testing. In: 2015 IEEE\/ACM 8th International Workshop on Search-Based Software Testing (SBST), pp. 17\u201318 (2015)","DOI":"10.1109\/SBST.2015.11"},{"issue":"9","key":"385_CR57","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/TSE.2015.2421279","volume":"41","author":"J Petke","year":"2015","unstructured":"Petke, J., Cohen, M.B., Harman, M., Yoo, S.: Practical combinatorial interaction testing: empirical findings on efficiency and early fault detection. IEEE Trans. Softw. Eng. 41(9), 901\u2013924 (2015)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"385_CR58","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/16M1067767","volume":"31","author":"K Sarkar","year":"2017","unstructured":"Sarkar, K., Colbourn, C.J.: Upper bounds on the size of covering arrays. SIAM J. Discrete Math. 31, 1277\u20131293 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"385_CR59","doi-asserted-by":"crossref","unstructured":"Schroeder, P.J., Bolaki, P., Gopu, V.: Comparing the fault detection effectiveness of n-way and random test suites. In: Proceedings of International Symposium on Empirical Software Engineering (ISESE04), pp. 49\u201359 (2004)","DOI":"10.1109\/ISESE.2004.1334893"},{"key":"385_CR60","doi-asserted-by":"crossref","unstructured":"Seidel, S.A., Mehari, M.T., Colbourn, C.J., De Poorter, E., Moerman, I., Syrotiuk, V.R.: Analysis of large-scale experimental data from wireless networks. In: IEEE INFOCOM International Workshop on Computer and Networking Experimental Research Using Testbeds (CNERT) (2018)","DOI":"10.1109\/INFCOMW.2018.8407023"},{"key":"385_CR61","first-page":"349","volume-title":"Lecture Notes in Computer Science","author":"Stephen A. Seidel","year":"2018","unstructured":"Seidel, S.A., Sarkar, K., Colbourn, C.J., Syrotiuk, V.R.: Separating interaction effects using locating and detecting arrays. In: International Workshop on Combinatorial Algorithms (2018)"},{"issue":"1","key":"385_CR62","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11425-011-4307-5","volume":"55","author":"C Shi","year":"2012","unstructured":"Shi, C., Tang, Y., Yin, J.: Optimal locating arrays for at most two faults. Sci. China Math. 55(1), 197\u2013206 (2012)","journal-title":"Sci. China Math."},{"key":"385_CR63","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0097-3165(74)90062-4","volume":"16","author":"SK Stein","year":"1974","unstructured":"Stein, S.K.: Two combinatorial covering theorems. J. Comb. Theory Ser. A 16, 391\u2013397 (1974)","journal-title":"J. Comb. Theory Ser. A"},{"key":"385_CR64","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/32.979992","volume":"28","author":"KC Tai","year":"2002","unstructured":"Tai, K.C., Yu, L.: A test generation strategy for pairwise testing. IEEE Trans. Softw. Eng. 28, 109\u2013111 (2002)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"385_CR65","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1080\/15598608.2012.647484","volume":"6","author":"Y Tang","year":"2012","unstructured":"Tang, Y., Colbourn, C.J., Yin, J.: Optimality and constructions of locating arrays. J. Stat. Theory Pract. 6(1), 20\u201329 (2012)","journal-title":"J. Stat. Theory Pract."},{"issue":"1","key":"385_CR66","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ins.2011.09.020","volume":"185","author":"J Torres-Jimenez","year":"2012","unstructured":"Torres-Jimenez, J., Rodriguez-Tello, E.: New upper bounds for binary covering arrays using simulated annealing. Inf. Sci. 185(1), 137\u2013152 (2012)","journal-title":"Inf. Sci."},{"key":"385_CR67","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/TSE.2006.8","volume":"31","author":"C Yilmaz","year":"2006","unstructured":"Yilmaz, C., Cohen, M.B., Porter, A.: Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Trans. Softw. Eng. 31, 20\u201334 (2006)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"385_CR68","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TSE.2013.53","volume":"40","author":"C Yilmaz","year":"2014","unstructured":"Yilmaz, C., Dumlu, E., Cohen, M.B., Porter, A.: Reducing masking effects in combinatorial interaction testing: A feedback driven adaptive approach. IEEE Trans. Softw. Eng. 40(1), 43\u201366 (2014)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"385_CR69","unstructured":"Zhang, Y.: On theory of compressive sensing via $$\\ell _1$$ \u2113 1 -minimization: Simple derivations and extensions. Tech. Rep. CAAM TR08-11, Rice University (2008)"},{"key":"385_CR70","doi-asserted-by":"crossref","unstructured":"Zhou, W., Zhang, D.: Sole error locating array and approximate error locating array. In: 2012 IEEE International Conference on Computer Science and Automation Engineering, pp. 480\u2013483 (2012)","DOI":"10.1109\/ICSESS.2012.6269509"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-018-0385-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0385-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0385-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T23:03:18Z","timestamp":1751929398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-018-0385-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,20]]},"references-count":70,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s11786-018-0385-x","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,20]]},"assertion":[{"value":"27 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}