{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:41:07Z","timestamp":1761709267674,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T00:00:00Z","timestamp":1472083200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["A-STEP grant AS2524001H"],"award-info":[{"award-number":["A-STEP grant AS2524001H"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,25]]},"DOI":"10.1145\/2970276.2970335","type":"proceedings-article","created":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T12:40:09Z","timestamp":1472215209000},"page":"614-624","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Greedy combinatorial test case generation using unsatisfiable cores"],"prefix":"10.1145","author":[{"given":"Akihisa","family":"Yamada","sequence":"first","affiliation":[{"name":"University of Innsbruck, Austria"}]},{"given":"Armin","family":"Biere","sequence":"additional","affiliation":[{"name":"JKU Linz, Austria"}]},{"given":"Cyrille","family":"Artho","sequence":"additional","affiliation":[{"name":"AIST, Japan"}]},{"given":"Takashi","family":"Kitamura","sequence":"additional","affiliation":[{"name":"AIST, Japan"}]},{"given":"Eun-Hye","family":"Choi","sequence":"additional","affiliation":[{"name":"AIST, Japan"}]}],"member":"320","published-online":{"date-parts":[[2016,8,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.46"},{"key":"e_1_3_2_1_2_1","first-page":"52","volume-title":"SAT Competition 2013","author":"Biere A.","year":"2013","unstructured":"A. Biere . Lingeling, Plingeling and Treengeling entering the SAT competition 2013 . In SAT Competition 2013 , pages 51\u2013 52 , 2013 . A. Biere. Lingeling, Plingeling and Treengeling entering the SAT competition 2013. In SAT Competition 2013, pages 51\u201352, 2013."},{"key":"e_1_3_2_1_3_1","unstructured":"A.\n      Biere\n    .\n  Yet another local search solver and Lingeling and friends entering the SAT Competition\n  2014\n  . \n  In SAT Competition\n   2014 volume B-2014-\n  2\n   of \n  Department of Computer Science Series of Publications B pages 39\u2013 \n  40\n  . University of Helsinki 2014.  A. Biere. Yet another local search solver and Lingeling and friends entering the SAT Competition 2014. In SAT Competition 2014 volume B-2014-2 of Department of Computer Science Series of Publications B pages 39\u2013 40. University of Helsinki 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646483.691738"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1550723"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2012.146"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.v17:3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062495"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.605761"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2008.50"},{"key":"e_1_3_2_1_11_1","first-page":"430","volume-title":"PNSQC 2006","author":"Czerwonka J.","year":"2006","unstructured":"J. Czerwonka . Pairwise testing in real world . In PNSQC 2006 , pages 419\u2013 430 , 2006 . J. Czerwonka. Pairwise testing in real world. In PNSQC 2006, pages 419\u2013430, 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82542-3"},{"key":"e_1_3_2_1_14_1","first-page":"518","volume-title":"SAT 2003","volume":"2919","author":"E\u00e9n N.","year":"2004","unstructured":"N. E\u00e9n and N. S\u00f6rensson . An extensible SAT-solver . In SAT 2003 , volume 2919 of LNCS, pages 502\u2013 518 , 2004 . N. E\u00e9n and N. S\u00f6rensson. An extensible SAT-solver. In SAT 2003, volume 2919 of LNCS, pages 502\u2013518, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2013.42"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSBSE.2009.25"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-010-9135-7"},{"key":"e_1_3_2_1_18_1","first-page":"110","volume-title":"International Workshop on Modelling and Reformulating Constraint Satisfaction","author":"Gent I. P.","year":"2004","unstructured":"I. P. Gent and P. Nightingale . A new encoding of alldifferent into SAT . In International Workshop on Modelling and Reformulating Constraint Satisfaction , pages 95\u2013 110 , 2004 . I. P. Gent and P. Nightingale. A new encoding of alldifferent into SAT. In International Workshop on Modelling and Reformulating Constraint Satisfaction, pages 95\u2013110, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-006-7094-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2818754.2818821"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362536.2362547"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/QRS.2015.29"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.24"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2500930"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"D. R.\n      Kuhn R.\n      Bryce F.\n      Duan L. S.\n      Ghandehari Y.\n      Lei and \n      R. N.\n      Kacker\n  . Chapter one \u2013 combinatorial testing: Theory and practice. volume \n  99\n   of \n  Advances in Computers pages 1\u2013\n  66\n  . Elsevier 2015.  D. R. Kuhn R. Bryce F. Duan L. S. Ghandehari Y. Lei and R. N. Kacker. Chapter one \u2013 combinatorial testing: Theory and practice. volume 99 of Advances in Computers pages 1\u201366. Elsevier 2015.","DOI":"10.1016\/bs.adcom.2015.05.003"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECBS.2007.47"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.61"},{"key":"e_1_3_2_1_28_1","volume-title":"IOS Press","author":"Marques-Silva J.","year":"2009","unstructured":"J. Marques-Silva , I. Lynce , and S. Malik . Conflictdriven clause learning sat solvers. In A. Biere, M. J. H. Heule, H. van Maaren, and T. Walsh, editors, Handbook of Satisfiability, chapter 4, pages 131\u2013153 . IOS Press , 2009 . J. Marques-Silva, I. Lynce, and S. Malik. Conflictdriven clause learning sat solvers. In A. Biere, M. J. H. Heule, H. van Maaren, and T. Walsh, editors, Handbook of Satisfiability, chapter 4, pages 131\u2013153. IOS Press, 2009."},{"key":"e_1_3_2_1_29_1","volume-title":"E95-A(9)","author":"Nanba T.","year":"2012","unstructured":"T. Nanba , T. Tsuchiya , and T. Kikuno . Using satisfiability solving for pairwise testing in the presence of constraints. IEICE Trans. Fundamentals , E95-A(9) , 2012 . T. Nanba, T. Tsuchiya, and T. Kikuno. Using satisfiability solving for pairwise testing in the presence of constraints. IEICE Trans. Fundamentals, E95-A(9), 2012."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883618"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001420.2001451"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-013-0291-0"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/646705.702179"},{"key":"e_1_3_2_1_34_1","first-page":"620","volume-title":"Proc. International Conference on Quality Control (ICQC 1987","author":"Tatsumi K.","year":"1987","unstructured":"K. Tatsumi . Test case design support system . In Proc. International Conference on Quality Control (ICQC 1987 ), pages 615\u2013 620 , 1987 . K. Tatsumi. Test case design support system. In Proc. International Conference on Quality Control (ICQC 1987), pages 615\u2013620, 1987."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"e_1_3_2_1_36_1","unstructured":"ISSN 00994987.  ISSN 00994987."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2015.7102599"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2013.35"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSTW.2015.7107441"}],"event":{"name":"ASE'16: ACM\/IEEE International Conference on Automated Software Engineering","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGSOFT ACM Special Interest Group on Software Engineering","IEEE-CS Computer Society"],"location":"Singapore Singapore","acronym":"ASE'16"},"container-title":["Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970276.2970335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2970276.2970335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:50:01Z","timestamp":1750218601000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970276.2970335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,25]]},"references-count":39,"alternative-id":["10.1145\/2970276.2970335","10.1145\/2970276"],"URL":"https:\/\/doi.org\/10.1145\/2970276.2970335","relation":{},"subject":[],"published":{"date-parts":[[2016,8,25]]},"assertion":[{"value":"2016-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}