{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T15:51:27Z","timestamp":1778082687237,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1109\/tcad.2018.2808229","type":"journal-article","created":{"date-parts":[[2018,2,21]],"date-time":"2018-02-21T19:27:45Z","timestamp":1519241265000},"page":"380-384","source":"Crossref","is-referenced-by-count":4,"title":["Logic Synthesis for Interpolant Circuit Compaction"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5839-8697","authenticated-orcid":false,"given":"G.","family":"Cabodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2476-2160","authenticated-orcid":false,"given":"P. E.","family":"Camurati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0605-9014","authenticated-orcid":false,"given":"M.","family":"Palena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6233-0994","authenticated-orcid":false,"given":"P.","family":"Pasini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5321-6513","authenticated-orcid":false,"given":"D.","family":"Vendraminetto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"227","article-title":"Efficient abstraction refinement in interpolation-based unbounded model checking","volume":"3920","author":"li","year":"2006","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.289"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-015-0229-0"},{"key":"ref13","first-page":"1","article-title":"A proof-sensitive approach for small propositional interpolants","author":"alt","year":"2015","journal-title":"Proc Verified Software Theories Tools Experiments Conf"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654209"},{"key":"ref15","article-title":"Cut sweeping","author":"e\u00e9n","year":"2007"},{"key":"ref16","first-page":"263","article-title":"Equivalence checking using cuts and heaps","author":"kuehlmann","year":"1997","journal-title":"Proc DAC"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382542"},{"key":"ref18","first-page":"514","article-title":"Extracting local don’t cares for network optimization","author":"savoj","year":"1991","journal-title":"Proc ICCAD"},{"key":"ref19","first-page":"1","article-title":"SAT-based complete don’t-care computation for network optimization","volume":"abs 710 4695","author":"mishchenko","year":"2007","journal-title":"CoRR"},{"key":"ref4","author":"biere","year":"2018","journal-title":"The Model Checking Competition"},{"key":"ref3","first-page":"1","article-title":"Interpolation and SAT-based model checking","volume":"2725","author":"mcmillan","year":"2003","journal-title":"Proc CAV"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11560548_33"},{"key":"ref5","first-page":"72","article-title":"Construction of abstract state graphs with PVS","author":"graf","year":"1997","journal-title":"Proc CAV"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1297666.1297669"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78163-9_10"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/2963594"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681563"},{"key":"ref1","first-page":"25","article-title":"Reducing interpolant circuit size by ad-hoc logic synthesis and SAT-based weakening","author":"cabodi","year":"2016","journal-title":"Proc FMCAD"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382541"},{"key":"ref22","first-page":"1","article-title":"A fast heuristic algorithm for redundancy removal","volume":"abs 1503 6632","author":"teslenko","year":"2015","journal-title":"CoRR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2009.5090934"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-011-0123-3"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2014.6987594"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2009147"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/8620168\/08299440.pdf?arnumber=8299440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:43Z","timestamp":1657746583000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8299440\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":26,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2018.2808229","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}