{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:46:30Z","timestamp":1729637190271,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1109\/iccd.2008.4751840","type":"proceedings-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T15:27:15Z","timestamp":1232465235000},"page":"52-59","source":"Crossref","is-referenced-by-count":0,"title":["Propositional approximations for bounded model checking of partial circuit designs"],"prefix":"10.1109","author":[{"given":"Bernd","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Herbstritt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia","family":"Kalinnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Lewis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juri","family":"Lichtner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Nopper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Wimmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Model checking","year":"1999","author":"clarke","key":"19"},{"key":"17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/978-3-540-30494-4_21","article-title":"approximate symbolic model checking for incomplete designs","volume":"3312","author":"nopper","year":"2004","journal-title":"Proc of Int'l Conf on Formal Methods in Computer-Aided Design (FMCAD)"},{"year":"2007","key":"18","article-title":"symbolic model checking for incomplete designs with flexible modeling of unknowns"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/11560548_19"},{"key":"16","article-title":"computation of minimal counterexamples by using black box techniques and symbolic methods","author":"nopper","year":"2007","journal-title":"Int Conf on Computer-Aided Design (ICCAD)"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01383966"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.850814"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382631"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.841068"},{"key":"21","article-title":"on the complexity of derivations in propositional calculus","author":"tseitin","year":"1968","journal-title":"Studies in Constructive Mathematics and Mathematical Logics"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/VTEST.2000.843854"},{"key":"22","first-page":"428","article-title":"vis: a system for verification and synthesis","volume":"1102","year":"1996","journal-title":"ser LNCS"},{"year":"0","key":"23"},{"year":"0","key":"24"},{"year":"0","key":"25"},{"year":"0","key":"26"},{"year":"0","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2006.229287"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/MTV.2005.16"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(03)58003-2","article-title":"bounded model checking","volume":"58","author":"biere","year":"2003","journal-title":"Advances in Computers"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382542"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1999.781333"},{"key":"30","first-page":"502","article-title":"an extensible sat-solver","volume":"2919","author":"ee?n","year":"2003","journal-title":"ser LNCS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75867-9_67"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/MTV.2006.3"},{"key":"9","first-page":"124","article-title":"combining decision diagrams and sat procedures for efficient symbolic model checking","volume":"1855","author":"williams","year":"2000","journal-title":"ser LNCS"},{"key":"8","first-page":"225","article-title":"functional extension of symbolic model checking","volume":"575","author":"filkorn","year":"1992","journal-title":"ser LNCS"}],"event":{"name":"2008 IEEE International Conference on Computer Design (ICCD)","start":{"date-parts":[[2008,10,12]]},"location":"Lake Tahoe, CA, USA","end":{"date-parts":[[2008,10,15]]}},"container-title":["2008 IEEE International Conference on Computer Design"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4740204\/4751825\/04751840.pdf?arnumber=4751840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T11:56:34Z","timestamp":1497786994000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4751840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/iccd.2008.4751840","relation":{},"subject":[],"published":{"date-parts":[[2008,10]]}}}