{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:00:35Z","timestamp":1772910035851,"version":"3.50.1"},"reference-count":75,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["118E204"],"award-info":[{"award-number":["118E204"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1109\/tse.2020.3010317","type":"journal-article","created":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T21:38:11Z","timestamp":1595281091000},"page":"1030-1066","source":"Crossref","is-referenced-by-count":7,"title":["Flexible Combinatorial Interaction Testing"],"prefix":"10.1109","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9171-082X","authenticated-orcid":false,"given":"Hanefi","family":"Mercan","sequence":"first","affiliation":[{"name":"Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arsalan","family":"Javeed","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4124-2295","authenticated-orcid":false,"given":"Cemal","family":"Yilmaz","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2013.408"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/32.605761"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.1996.558835"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2002.1115005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362547"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.369"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.50"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.65"},{"key":"ref11","first-page":"9","article-title":"Cost-aware combinatorial interaction testing","volume-title":"Proc. Int. Conf. Advances Syst. Testing Validation Lifecycles","author":"Demiroz"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2015.7107438"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.37236\/571"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001450"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1273463.1273482"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2006.03.004"},{"key":"ref17","article-title":"Handling constraints in the input space when using combination strategies for software testing","author":"Mats","year":"2006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.65"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.12775\/LLP.2016.027"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00248398"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/bf00154005"},{"key":"ref22","volume-title":"Handbook of Satisfiability","volume":"185","author":"Biere","year":"2009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.057"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884853"},{"key":"ref25","first-page":"24","article-title":"A constraint solving problem towards unified combinatorial interaction testing","volume-title":"Proc. 7th Workshop Constraint Solvers Testing Verification Anal.","author":"Mercan"},{"key":"ref26","article-title":"Gray-box combinatorial interaction testing","author":"Javeed","year":"2015"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2005.05.030"},{"key":"ref28","article-title":"Radon"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.52"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572294"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806819"},{"key":"ref32","article-title":"SATisPy"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD.2008.100"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2011.59"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.364"},{"key":"ref37","article-title":"Interleaving coverage criteria oriented testing of multithreaded applications","author":"\u00c7alpur","year":"2012"},{"key":"ref38","article-title":"Systematic testing of multithreaded Java programs","author":"Bruening","year":"1999"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71410-1_2"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287703"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2012.147"},{"key":"ref42","article-title":"Apache ActiveMQ"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(03)58003-2"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref45","volume-title":"Introduction to Automata Theory, Languages and Computation: For VTU, 3\/e","author":"Hopcroft","year":"2013"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.007"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03754-2_2"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"ref51","first-page":"65","article-title":"Sugar: A CSP to SAT translator based on order encoding","volume-title":"Proc. 2nd Int. CSP Solver Competition","author":"Tamura"},{"key":"ref52","article-title":"jenny: A pairwise testing tool","author":"Jenkins","year":"2005"},{"key":"ref53","article-title":"Pairwise testing in the real world: Practical extensions to test-case scenarios","author":"Czerwonka"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21581-0_27"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10452-7_3"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CMPSAC.2003.1245373"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1002\/9780471703778"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1082983.1083288"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/MITP.2008.54"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISESE.2004.1334893"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/SEW.2006.26"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.07.010"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2012.15"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.381"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.8.12.3173-3181"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201186"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277173"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2362532"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071324"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2015.71"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.09.020"},{"key":"ref72","article-title":"Design and evaluation of automatic test generation strategies for functional testing of software","author":"Kobayashi","year":"2002"},{"key":"ref73","first-page":"121","article-title":"Combinatorial aspects of covering arrays","volume":"58","author":"Colbourn","year":"2004","journal-title":"Le Matematiche (Catania)"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/505145.505149"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2013.53"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/9734765\/09144457.pdf?arnumber=9144457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:33:54Z","timestamp":1704843234000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9144457\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":75,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tse.2020.3010317","relation":{},"ISSN":["0098-5589","1939-3520","2326-3881"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"},{"value":"2326-3881","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]}}}