{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:44:51Z","timestamp":1761709491877,"version":"3.37.3"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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":["113E546"],"award-info":[{"award-number":["113E546"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007065","name":"Nvidia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007065","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2019,12,1]]},"DOI":"10.1109\/tse.2018.2837759","type":"journal-article","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T19:19:48Z","timestamp":1526584788000},"page":"1270-1291","source":"Crossref","is-referenced-by-count":20,"title":["CHiP: A Configurable Hybrid Parallel Covering Array Constructor"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9171-082X","authenticated-orcid":false,"given":"Hanefi","family":"Mercan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4124-2295","authenticated-orcid":false,"given":"Cemal","family":"Yilmaz","sequence":"additional","affiliation":[]},{"given":"Kamer","family":"Kaya","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"59","article-title":"Determination of test configurations for pair-wise interaction coverage","author":"williams","year":"2000","journal-title":"Proc IFIP TC6\/WG6 1 13th Int Conf Testing Communicating Syst Tools Techn"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FOSE.2007.29"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.09.020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1486"},{"key":"ref31","first-page":"65","article-title":"Sugar: A CSP to SAT translator based on order encoding","author":"tamura","year":"2008","journal-title":"Proc 2nd Int CSP Solver Competition"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88636-5_4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2362532"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277173"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201186"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.381"},{"article-title":"Using simulated annealing for computing test case-aware covering arrays","year":"2014","author":"ko\u00e7","key":"ref28"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2003.1251061"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/moor.13.2.311"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1027092.1027093"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Sci"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/bs.adcom.2015.05.003"},{"article-title":"An introduction to gpgpu programming-cuda architecture","year":"2010","author":"inam","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00291-9"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/HASE.2014.18"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008329410829"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.10039"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/WETICE.2009.52"},{"key":"ref51","doi-asserted-by":"crossref","DOI":"10.4995\/Thesis\/10251\/17027","article-title":"Constructing covering arrays using parallel computing and grid computing","author":"avila george","year":"2012"},{"key":"ref59","first-page":"9","article-title":"Cost-aware combinatorial interaction testing","author":"demiroz","year":"2012","journal-title":"Proc Conf on Advances in System Testing and Validation Lifecycle"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2013.53"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.65"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2006.03.004"},{"article-title":"Handling constraints in the input space when using combination strategies for software testing","year":"2006","author":"mats","key":"ref55"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.057"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1273463.1273482"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.10.0109.0266"},{"article-title":"jenny: A pairwise testing tool","year":"2005","author":"jenkins","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.52"},{"journal-title":"Design and Evaluation of Automatic Test Generation Strategies for Functional Testing of Software","year":"2002","author":"kobayashi","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.35"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SSBSE.2009.25"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001451"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2008.50"},{"key":"ref16","first-page":"540","article-title":"Learning combinatorial interaction test generation strategies using hyperheuristic search","author":"jia","year":"2015","journal-title":"Proceedings of the International Conference on Software Engineering ICSE'94"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1145\/2970276.2970335","article-title":"Greedy combinatorial test case generation using unsatisfiable cores","author":"yamada","year":"2016","journal-title":"Proc 1st IEEE\/ACM Int Conf Automated Softw Eng"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2015.7102599"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm","volume":"45","author":"?ern?","year":"1985","journal-title":"J Optimization Theory Appl"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.50"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362547"},{"key":"ref6","article-title":"Efficient software testing protocols","author":"stevens","year":"1998","journal-title":"Proc Conf Centre Adv Stud Collaborative Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.369"},{"year":"0","author":"czerwonka","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2006.33"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.61"},{"key":"ref46","first-page":"172","article-title":"Constraint-based approaches to the covering test problem","author":"hnich","year":"2004","journal-title":"International Workshop on Constraint Solving and Constraint Logic Programming"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9135-7"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-642-16242-8_9","article-title":"Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers","author":"banbara","year":"2010","journal-title":"Logic for Programming Artificial Intelligence and Reasoning"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-006-7094-9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/11851561_13"},{"key":"ref41","first-page":"283","article-title":"Formulation of the interaction test coverage problem as an integer program","author":"williams","year":"2002","journal-title":"Proc IFIP 14th Int Conf Testing Communicating Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2009.7"},{"key":"ref43","first-page":"121","article-title":"Combinatorial aspects of covering arrays","volume":"58","author":"colbourn","year":"2004","journal-title":"Le Matematiche (Catania)"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/8930349\/08360512.pdf?arnumber=8360512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:28Z","timestamp":1657746868000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8360512\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,1]]},"references-count":59,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tse.2018.2837759","relation":{},"ISSN":["0098-5589","1939-3520","2326-3881"],"issn-type":[{"type":"print","value":"0098-5589"},{"type":"electronic","value":"1939-3520"},{"type":"electronic","value":"2326-3881"}],"subject":[],"published":{"date-parts":[[2019,12,1]]}}}