{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T15:47:36Z","timestamp":1792943256446,"version":"4.5.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T00:00:00Z","timestamp":1278979200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Empir Software Eng"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10664-010-9135-7","type":"journal-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T14:20:12Z","timestamp":1278944412000},"page":"61-102","source":"Crossref","is-referenced-by-count":212,"title":["Evaluating improvements to a meta-heuristic search for constrained interaction testing"],"prefix":"10.1007","volume":"16","author":[{"given":"Brady J.","family":"Garvin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Myra B.","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew B.","family":"Dwyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,7,13]]},"reference":[{"issue":"10","key":"9135_CR1","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.infsof.2006.03.004","volume":"48","author":"RC Bryce","year":"2006","unstructured":"Bryce RC, Colbourn CJ (2006) Prioritized interaction testing for pair-wise coverage with seeding and constraints. Inform Software Tech 48(10):960\u2013970","journal-title":"Inform Software Tech"},{"key":"9135_CR2","doi-asserted-by":"crossref","unstructured":"Bryce R, Colbourn CJ (2007) One-test-at-a-time heuristic search for interaction test suites. In: 9th conference on genetic and evolutionary computation, pp 1082\u20131089","DOI":"10.1145\/1276958.1277173"},{"key":"9135_CR3","unstructured":"Bryce R, Colbourn CJ, Cohen MB (2005) A framework of greedy methods for constructing interaction tests. In: 27th international conference on software engineering, pp 146\u2013155"},{"key":"9135_CR4","doi-asserted-by":"crossref","unstructured":"Calvagna A, Gargantini A (2009) Combining satisfiability solving and heuristics to constrained combinatorial interaction testing. In: 3rd international conference on tests and proofs. Springer, pp 27\u201342","DOI":"10.1007\/978-3-642-02949-3_4"},{"issue":"4","key":"9135_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M Chateauneuf","year":"2002","unstructured":"Chateauneuf M, Kreher DL (2002) On the state of strength-three covering arrays. J Comb Des 10(4):217\u2013238","journal-title":"J Comb Des"},{"key":"9135_CR6","unstructured":"Clements P, Northrup L (2002) Software product lines: practices and patterns. Addison-Wesley"},{"issue":"11\u201312","key":"9135_CR7","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"C Coello Coello","year":"2002","unstructured":"Coello Coello C (2002) Theoretical and numerical constraint handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11\u201312):1245\u20131287","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"7","key":"9135_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/32.605761","volume":"23","author":"DM Cohen","year":"1997","unstructured":"Cohen DM, Dalal SR, Fredman ML, Patton GC (1997) The AETG system: an approach to testing based on combinatorial design. IEEE Trans Softw Eng 23(7):437\u2013444","journal-title":"IEEE Trans Softw Eng"},{"key":"9135_CR9","doi-asserted-by":"crossref","unstructured":"Cohen MB, Colbourn CJ, Ling ACH (2003a) Augmenting simulated annealing to build interaction test suites. In: 14th international symposium on software reliability engineering, pp 394\u2013405","DOI":"10.1109\/ISSRE.2003.1251061"},{"key":"9135_CR10","doi-asserted-by":"crossref","unstructured":"Cohen MB, Gibbons PB, Mugridge WB, Colbourn CJ (2003b) Constructing test suites for interaction testing. In: 25th international conference on software engineering, pp 38\u201348","DOI":"10.1109\/ICSE.2003.1201186"},{"key":"9135_CR11","doi-asserted-by":"crossref","unstructured":"Cohen MB, Dwyer MB, Shi J (2007a) Exploiting constraint solving history to construct interaction test suites. In: 2nd testing: academic and industrial conference\u2014practice and research techniques, pp 121\u2013130","DOI":"10.1109\/TAIC.PART.2007.17"},{"key":"9135_CR12","doi-asserted-by":"crossref","unstructured":"Cohen MB, Dwyer MB, Shi J (2007b) Interaction testing of highly-configurable systems in the presence of constraints. In: 5th international symposium on software testing and analysis, pp 129\u2013139","DOI":"10.1145\/1273463.1273482"},{"issue":"5","key":"9135_CR13","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TSE.2008.50","volume":"34","author":"MB Cohen","year":"2008","unstructured":"Cohen MB, Dwyer MB, Shi J (2008) Constructing interaction test suites for highly-configurable systems in the presence of constraints: a greedy approach. IEEE Trans Softw Eng 34(5):633\u2013650","journal-title":"IEEE Trans Softw Eng"},{"key":"9135_CR14","unstructured":"Colbourn C (2009) Covering array tables. Available at http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby\/catable.html . Accessed 28 September 2009"},{"key":"9135_CR15","first-page":"121","volume":"58","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn CJ (2004) Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58:121\u2013167","journal-title":"Le Matematiche (Catania)"},{"key":"9135_CR16","unstructured":"Colbourn CJ, Cohen MB, Turban RC (2004) A deterministic density algorithm for pairwise interaction coverage. In: 1st IASTED international conference on software engineering, pp 345\u2013352"},{"key":"9135_CR17","unstructured":"Czerwonka J (2006) Pairwise testing in real world. In: 10th Pacific northwest software quality conference, pp 419\u2013430"},{"key":"9135_CR18","unstructured":"E\u00e9n N, S\u00f6rrenson N (2007) MiniSAT-C v1.14.1. Available at http:\/\/minisat.se\/ . Accessed 29 June 2010"},{"key":"9135_CR19","doi-asserted-by":"crossref","unstructured":"Fouch\u00e9 S, Cohen MB, Porter A (2009) Incremental covering array failure characterization in large configuration spaces. In: 7th international symposium on software testing and analysis, pp 177\u2013187","DOI":"10.1145\/1572272.1572294"},{"key":"9135_CR20","doi-asserted-by":"crossref","unstructured":"Garousi V (2008) Empirical analysis of a genetic algorithm-based stress test technique. In: Proceedings of annual conference on genetic and evolutionary computation, pp 1743\u20131750","DOI":"10.1145\/1389095.1389433"},{"key":"9135_CR21","doi-asserted-by":"crossref","unstructured":"Garvin BJ, Cohen MB, Dwyer MB (2009) An improved meta-heuristic search for constrained interaction testing. In: 1st international symposium on search based software engineering, pp 13\u201322","DOI":"10.1109\/SSBSE.2009.25"},{"key":"9135_CR22","doi-asserted-by":"crossref","unstructured":"Grieskamp W, Qu X, Wei X, Kicillof N, Cohen MB (2009) Interaction coverage meets path coverage by SMT constraint solving. In: Testing of communicating systems and international workshop on formal approaches to testing of software","DOI":"10.1007\/978-3-642-05031-2_7"},{"key":"9135_CR23","doi-asserted-by":"crossref","unstructured":"Harman M (2007) The current state and future of search based software engineering. In: Future of software engineering, pp 342\u2013357","DOI":"10.1109\/FOSE.2007.29"},{"key":"9135_CR24","doi-asserted-by":"crossref","unstructured":"Harman M, Tratt L (2007) Pareto optimal search based refactoring at the design level. In: 9th conference on genetic and evolutionary computation, pp 1106\u20131113","DOI":"10.1145\/1276958.1277176"},{"key":"9135_CR25","doi-asserted-by":"crossref","unstructured":"Harman M, Swift S, Mahdavi K (2005) An empirical study of the robustness of two module clustering fitness functions. In: 7th conference on genetic and evolutionary computation, pp 1029\u20131036","DOI":"10.1145\/1068009.1068184"},{"key":"9135_CR26","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A Hartman","year":"2004","unstructured":"Hartman A, Raskin L (2004) Problems and algorithms for covering arrays. Discrete Math 284:149\u2013156","journal-title":"Discrete Math"},{"key":"9135_CR27","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10601-006-7094-9","volume":"11","author":"B Hnich","year":"2006","unstructured":"Hnich B, Prestwich S, Selensky E, Smith BM (2006) Constraint models for the covering test problem. Constraints 11:199\u2013219","journal-title":"Constraints"},{"issue":"6","key":"9135_CR28","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"DR Kuhn","year":"2004","unstructured":"Kuhn DR, Wallace DR, Gallo AM (2004) Software fault interactions and implications for software testing. IEEE Trans Softw Eng 30(6):418\u2013421","journal-title":"IEEE Trans Softw Eng"},{"key":"9135_CR29","unstructured":"Lei Y, Tai KC (1998) In-parameter-order: a test generation strategy for pairwise testing. In: 3rd international symposium on high-assurance systems engineering, pp 254\u2013261"},{"key":"9135_CR30","first-page":"549","volume-title":"14th international conference on the engineering of computer-based systems","author":"Y Lei","year":"2007","unstructured":"Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2007) IPOG: a general strategy for t-way software testing. In: 14th international conference on the engineering of computer-based systems, pp 549\u2013556"},{"issue":"4","key":"9135_CR31","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TSE.2007.38","volume":"33","author":"Z Li","year":"2007","unstructured":"Li Z, Harman M, Hierons RM (2007) Search algorithms for regression test case prioritization. IEEE Trans Softw Eng 33(4):225\u2013237","journal-title":"IEEE Trans Softw Eng"},{"key":"9135_CR32","unstructured":"Malik S (2004) zChaff. Available at http:\/\/www.princeton.edu\/~chaff\/zchaff.html . Accessed 29 June 2010"},{"issue":"2","key":"9135_CR33","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/stvr.294","volume":"14","author":"P McMinn","year":"2004","unstructured":"McMinn P (2004) Search-based software test data generation: a survey. Softw Test Verif Reliab 14(2):105\u2013156","journal-title":"Softw Test Verif Reliab"},{"key":"9135_CR34","unstructured":"Memon A, Porter A, Yilmaz C, Nagarajan A, Schmidt DC, Natarajan B (2004) Skoll: distributed continuous quality assurance. In: 26th international conference on software engineering"},{"issue":"1\u20132","key":"9135_CR35","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0166-218X(03)00291-9","volume":"138","author":"KJ Nurmela","year":"2004","unstructured":"Nurmela KJ (2004) Upper bounds for covering arrays by tabu search. Discrete Appl Math 138(1\u20132):143\u2013152","journal-title":"Discrete Appl Math"},{"key":"9135_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-28901-1","volume-title":"Software product line engineering","author":"K Pohl","year":"2005","unstructured":"Pohl K, B\u00f6ckle G, van\u00a0der Linden F (2005) Software product line engineering. Springer, Berlin"},{"key":"9135_CR37","doi-asserted-by":"crossref","unstructured":"Qu X, Cohen MB, Rothermel G (2008) Configuration-aware regression testing: an empirical study of sampling and prioritization. In: 6th international symposium on software testing and analysis, pp 75\u201385","DOI":"10.1145\/1390630.1390641"},{"key":"9135_CR38","unstructured":"Stardom J (2001) Metaheuristics and the search for covering and packing arrays. Master\u2019s thesis, Simon Fraser University"},{"key":"9135_CR39","unstructured":"Stevens B (1998) Transversal covers and packings. PhD thesis, University of Toronto"},{"issue":"1","key":"9135_CR40","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/32.979992","volume":"28","author":"KC Tai","year":"2002","unstructured":"Tai KC, Lei Y (2002) A test generation strategy for pairwise testing. IEEE Trans Softw Eng 28(1):109\u2013111","journal-title":"IEEE Trans Softw Eng"},{"issue":"1","key":"9135_CR41","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/TSE.2006.8","volume":"31","author":"C Yilmaz","year":"2006","unstructured":"Yilmaz C, Cohen MB, Porter A (2006) Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Trans Softw Eng 31(1):20\u201334","journal-title":"IEEE Trans Softw Eng"}],"container-title":["Empirical Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10664-010-9135-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10664-010-9135-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10664-010-9135-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:14:00Z","timestamp":1740258840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10664-010-9135-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,13]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["9135"],"URL":"https:\/\/doi.org\/10.1007\/s10664-010-9135-7","relation":{},"ISSN":["1382-3256","1573-7616"],"issn-type":[{"value":"1382-3256","type":"print"},{"value":"1573-7616","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,13]]}}}