{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:23:31Z","timestamp":1785039811121,"version":"3.55.0"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Brazilian Funding Agencies Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000028","name":"Semiconductor Research Corporation","doi-asserted-by":"publisher","award":["2710.001"],"award-info":[{"award-number":["2710.001"]}],"id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000028","name":"Semiconductor Research Corporation","doi-asserted-by":"publisher","award":["2867.001"],"award-info":[{"award-number":["2867.001"]}],"id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/tcad.2019.2946254","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T19:58:29Z","timestamp":1570564709000},"page":"3081-3092","source":"Crossref","is-referenced-by-count":11,"title":["Parallel Combinational Equivalence Checking"],"prefix":"10.1109","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4334-1174","authenticated-orcid":false,"given":"Vinicius N.","family":"Possani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Mishchenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9895-7489","authenticated-orcid":false,"given":"Renato P.","family":"Ribas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andre I.","family":"Reis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34188-5_8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63516-3"},{"key":"ref33","article-title":"Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT race 2010","author":"biere","year":"2010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190070"},{"key":"ref31","first-page":"46","article-title":"Description of ppfolio","author":"roussel","year":"2012","journal-title":"Proc SAT Challenge"},{"key":"ref30","first-page":"31","author":"balyo","year":"2018","journal-title":"Parallel Satisfiability"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-005-1970-7"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_39"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2015.18"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24318-4_12"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0183-4"},{"key":"ref27","first-page":"46","author":"kurshan","year":"2008","journal-title":"Verification Technology Transfer"},{"key":"ref29","first-page":"277","author":"biere","year":"2018","journal-title":"SAT-based Model-Checking"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882484"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5.52213"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1993.580110"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382542"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"ref24","author":"clarke","year":"1999","journal-title":"Model checking"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80410-9"},{"key":"ref25","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref50","author":"heule","year":"2019","journal-title":"Cube-and-Conquer SAT Solver"},{"key":"ref51","article-title":"Symbiosis of search and heuristics for random 3-SAT","author":"mijnders","year":"2010","journal-title":"Proc 3rd Workshop Logic Search"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.264"},{"key":"ref53","first-page":"229","article-title":"SAT sweeping with local observability don’t-cares","author":"zhu","year":"2006","journal-title":"Proc Design Autom Conf (DAC)"},{"key":"ref52","first-page":"31","author":"heule","year":"2018","journal-title":"Cube-and-Conquer for Satisfiability"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_12"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30494-4_11"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2010.5647645"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"ref13","first-page":"892","article-title":"A circuit SAT solver with signal correlation guided learning","author":"lu","year":"2003","journal-title":"Proceedings of the Design Automation and Test in Europe (DATE)"},{"key":"ref14","first-page":"836","article-title":"Improvements to combinational equivalence checking","author":"mishchenko","year":"2006","journal-title":"Proc Int Conf Comput -Aided Design (ICCAD)"},{"key":"ref15","first-page":"15","article-title":"Scalable logic synthesis using a simple circuit structure","author":"mishchenko","year":"2006","journal-title":"Int Workshop Logic Synthesis Tech Dig (IWLS)"},{"key":"ref16","first-page":"155","volume":"185","author":"heule","year":"2009","journal-title":"Look-Ahead Based SAT Solvers"},{"key":"ref17","first-page":"131","volume":"185","author":"marques-silva","year":"2009","journal-title":"Conflict-Driven Clause Learning SAT Solvers"},{"key":"ref18","first-page":"502","article-title":"An extensible SAT-solver","author":"e\u00e9n","year":"2003","journal-title":"Proc Int Conf Theory Appl Satisfiability Test"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82542-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681580"},{"key":"ref3","first-page":"372","article-title":"SAT-based verification without state space traversal","author":"bjesse","year":"2000","journal-title":"Proc Formal Methods in Computer Aided Design (FMCAD)"},{"key":"ref6","year":"2018","journal-title":"ABC A System for Sequential Synthesis and Verification"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687546"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2014.2313451"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2012.2237140"},{"key":"ref49","first-page":"57","article-title":"The EPFL combinational benchmark suite","author":"amar\u00fa","year":"2015","journal-title":"Int Workshop Logic Synthesis Tech Dig (IWLS)"},{"key":"ref9","first-page":"629","article-title":"An efficient equivalence checker for combinational circuits","author":"matsunaga","year":"1996","journal-title":"Proc Design Autom Conf (DAC)"},{"key":"ref46","article-title":"FRAIGs: A unifying representation for logic synthesis and verification","author":"mishchenko","year":"2005"},{"key":"ref45","first-page":"1048","article-title":"Formal verification of integer multipliers by combining Gröbner basis with logic reduction","author":"sayed-ahmed","year":"2016","journal-title":"Proceedings of the Design Automation and Test in Europe (DATE)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2068716.2068720"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2009.5090871"},{"key":"ref42","first-page":"899","article-title":"Efficient Gröbner basis reductions for formal verification of galois field multipliers","author":"lv","year":"2012","journal-title":"Proceedings of the Design Automation and Test in Europe (DATE)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_45"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2015.01.007"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744925"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/9204502\/08862936.pdf?arnumber=8862936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:05:08Z","timestamp":1651068308000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8862936\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":54,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2019.2946254","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}