{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T01:51:23Z","timestamp":1761789083951,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1109\/aspdac.2013.6509685","type":"proceedings-article","created":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T19:36:53Z","timestamp":1367609813000},"page":"717-722","source":"Crossref","is-referenced-by-count":1,"title":["Reviving erroneous stability-based clock-gating using partial Max-SAT"],"prefix":"10.1109","author":[{"family":"Bao Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Sengupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Veneris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2012","key":"17"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061370"},{"journal-title":"Power Compiler","year":"0","author":"synopsys","key":"16"},{"key":"13","first-page":"115","article-title":"On the complexity of derivations in the propositional calculus","author":"tseitin","year":"1968","journal-title":"Studies in Constructive Mathematics and Mathematical Logic"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.852031"},{"journal-title":"Maxsatz","year":"2012","author":"evaluation","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061270"},{"key":"3","first-page":"658","article-title":"A new paradigm for synthesis and propagation of clock gating conditions","author":"ranan fraer","year":"2008","journal-title":"Design Automation Conf"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.839489(410) 24"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/225871.225877"},{"key":"10","first-page":"613","article-title":"A, maxsat, hard and soft constraints","volume":"185","author":"li","year":"2009","journal-title":"IOS Press"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/43.503933"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/323480.323482"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/81.841927"},{"key":"4","article-title":"Fast synthesis of clock gates from existing logic","author":"hurst","year":"2007","journal-title":"Int'l Workshop on Logic Synth"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2011.5722243"},{"key":"8","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/1629911.1629957","article-title":"resurrecting infeasible clock-gating functions","author":"arbel","year":"2009","journal-title":"2009 46th ACM\/IEEE Design Automation Conference dac"}],"event":{"name":"2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC 2013)","start":{"date-parts":[[2013,1,22]]},"location":"Yokohama","end":{"date-parts":[[2013,1,25]]}},"container-title":["2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6507004\/6509548\/06509685.pdf?arnumber=6509685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T08:31:17Z","timestamp":1498033877000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6509685\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/aspdac.2013.6509685","relation":{},"subject":[],"published":{"date-parts":[[2013,1]]}}}