{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:25:11Z","timestamp":1725506711741},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1109\/aspdac.2008.4483983","type":"proceedings-article","created":{"date-parts":[[2008,4,10]],"date-time":"2008-04-10T18:56:31Z","timestamp":1207853791000},"page":"398-403","source":"Crossref","is-referenced-by-count":2,"title":["Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof"],"prefix":"10.1109","author":[{"given":"Udo","family":"Krautz","sequence":"first","affiliation":[]},{"given":"Markus","family":"Wedler","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Kunz","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Weber","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Jacobi","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Pflanz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/HLDVT.2001.972817"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.812320"},{"year":"0","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1995.479878"},{"key":"13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-61474-5_66","article-title":"verification of arithmetic circuits by comparing two similar circuits","author":"fujita","year":"1996","journal-title":"Proceedings of the 8th International Conference on Computer Aided Verification"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2002.1012641"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1995.479995"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/370155.370315"},{"key":"3","first-page":"190","article-title":"induction-based gate-level verification of multipliers","author":"chang","year":"2001","journal-title":"ICCAD"},{"year":"0","key":"2"},{"year":"0","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.1999.808376"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ASIC.1996.551984"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"5","first-page":"183","article-title":"verification of integer multipliers on the arithmetic bit level","author":"stoffel","year":"2001","journal-title":"ICCAD"},{"key":"4","first-page":"535","article-title":"verification of arithmetic functions by binary moment diagrams","author":"bryant","year":"0","journal-title":"Design Automation Conference 1995 Proceedings"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/330855.330957"},{"key":"8","first-page":"129","article-title":"inside the pentium fdiv bug","author":"coe","year":"1996","journal-title":"Dr Dobbs Journal"}],"event":{"name":"13th Asia and South Pacific Design Automation Conference ASP-DAC 2008","start":{"date-parts":[[2008,3,21]]},"location":"Seoul","end":{"date-parts":[[2008,3,24]]}},"container-title":["2008 Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4480121\/4483913\/04483983.pdf?arnumber=4483983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T01:46:59Z","timestamp":1588902419000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4483983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/aspdac.2008.4483983","relation":{},"subject":[],"published":{"date-parts":[[2008,1]]}}}