{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:28:55Z","timestamp":1758893335265},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1109\/memcod.2008.4547681","type":"proceedings-article","created":{"date-parts":[[2008,6,20]],"date-time":"2008-06-20T11:40:32Z","timestamp":1213962032000},"page":"7-16","source":"Crossref","is-referenced-by-count":9,"title":["Arithmetic Circuits Verification without Looking for Internal Equivalences"],"prefix":"10.1109","author":[{"given":"O.","family":"Sarbishei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Alizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Fujita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"15","article-title":"a canonical and compact hybrid word-boolean representation as a formal model for hardware\/software co-designs","author":"alizadeh","year":"2007","journal-title":"fourth Workshop on Constraints in Formal Verification (CFV)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560081"},{"key":"12","article-title":"reasoning in boolean networks - logic synthesis and verification using testing techniques","author":"kunz","year":"1997","journal-title":"Boston"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/12.73590"},{"key":"2","first-page":"46","article-title":"implicit verification of structually dissimilar arithmetic circuits","author":"stanion","year":"1999","journal-title":"Proc IEEE International Conference on Computer Design (ICCD)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1993.580110"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1109\/DATE.2006.244150","article-title":"equivalence verification of polynomial datapath with multiple word-length operands","author":"shekhar","year":"2006","journal-title":"Proc International Conference on Design Automation and Test in Europe (DATE-06)"},{"key":"7","article-title":"verification of arithmetic circuits by comparing two similar circuits","author":"fujita","year":"0","journal-title":"Proc International Conference on Computer Aided Verification (CAV'96)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1995.479995"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217583"},{"key":"4","article-title":"formal equivalence checking and design debugging","author":"huang","year":"1998","journal-title":"Kluwer Academic Publishers"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065699"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2001.968616"}],"event":{"name":"2008 6th ACM\/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE '08)","start":{"date-parts":[[2008,6,5]]},"location":"Anaheim, CA, USA","end":{"date-parts":[[2008,6,7]]}},"container-title":["2008 6th ACM\/IEEE International Conference on Formal Methods and Models for Co-Design"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4542603\/4547672\/04547681.pdf?arnumber=4547681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T05:17:58Z","timestamp":1497763078000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4547681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/memcod.2008.4547681","relation":{},"subject":[],"published":{"date-parts":[[2008,6]]}}}