{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:58:20Z","timestamp":1772909900490,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icst.2015.7102599","type":"proceedings-article","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T11:54:04Z","timestamp":1431086044000},"page":"1-10","source":"Crossref","is-referenced-by-count":38,"title":["Optimization of Combinatorial Testing by Incremental SAT Solving"],"prefix":"10.1109","author":[{"given":"Akihisa","family":"Yamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Kitamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyrille","family":"Artho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eun-Hye","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yutaka","family":"Oiwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Biere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-43429-1","author":"zhang","year":"2014","journal-title":"Automatic Generation of Combinatorial Test Data"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.35"},{"key":"ref30","first-page":"10","article-title":"On the complexity of derivation in propositional calculus","volume":"2","author":"tseitin","year":"1968","journal-title":"Studies in Constructive Mathematics and Mathematical Logic"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2003.1251061"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2008.50"},{"key":"ref12","first-page":"419","article-title":"Pairwise testing in real world","author":"czerwonka","year":"2006","journal-title":"PNSQC 2006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82542-3"},{"key":"ref14","first-page":"502","article-title":"An extensible SAT-solver","volume":"2919","author":"een","year":"2004","journal-title":"SAT 2003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46135-3_31"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SSBSE.2009.25"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9135-7"},{"key":"ref18","first-page":"95","article-title":"A new encoding of alldifferent into SA T","author":"gent","year":"2004","journal-title":"International Workshop on Modelling and Reformulating Constraint Satisfaction"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04244-7_32"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"ref4","first-page":"193","article-title":"Symbolic model checking without BDDs","volume":"1579","author":"biere","year":"1999","journal-title":"TACAS 1999"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2012.07.017"},{"key":"ref3","first-page":"39","article-title":"Yet another local search solver and Lingeling and friends entering the SAT Competition 2014","author":"biere","year":"2014","journal-title":"SAT Competition 2014 volume B-2014–2 of Department of Computer Science Series of Publications B"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606564"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44798-9_4"},{"key":"ref5","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"ref8","first-page":"263","article-title":"Local search algorithms for partial MAXSA T","author":"cha","year":"1997","journal-title":"AAAI\/IAAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2012.146"},{"key":"ref2","first-page":"112","article-title":"Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers","volume":"6397","author":"banbara","year":"2010","journal-title":"LPAR-17"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/32.605761"},{"key":"ref1","first-page":"51","article-title":"A max-SAT-based approach to constructing optimal covering arrays","volume":"256","author":"ansotegui","year":"2013","journal-title":"CCIA 2013"},{"key":"ref20","author":"harris","year":"2007","journal-title":"Digital Design and computer Architecture"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/11402763_13"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.11.029"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-006-7094-9"},{"key":"ref26","first-page":"408","article-title":"Randomized postoptimization of covering arrays","volume":"5874","author":"nayeri","year":"2009","journal-title":"IWOCA 2009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.1501"}],"event":{"name":"2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)","location":"Graz, Austria","start":{"date-parts":[[2015,4,13]]},"end":{"date-parts":[[2015,4,17]]}},"container-title":["2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7102553\/7102573\/07102599.pdf?arnumber=7102599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T03:02:18Z","timestamp":1691636538000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7102599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icst.2015.7102599","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}