{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:51:04Z","timestamp":1725612664501},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1109\/aspdac.2014.6742977","type":"proceedings-article","created":{"date-parts":[[2014,2,21]],"date-time":"2014-02-21T21:20:31Z","timestamp":1393017631000},"page":"732-737","source":"Crossref","is-referenced-by-count":1,"title":["Automated debugging of missing assumptions"],"prefix":"10.1109","author":[{"given":"Brian","family":"Keng","sequence":"first","affiliation":[]},{"given":"Evean","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Veneris","sequence":"additional","affiliation":[]},{"given":"Bao","family":"Le","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"502","article-title":"An extensible SAT-solver","author":"een","year":"2003","journal-title":"Int'l Conf on Theory and Applications of Satisfiability Testing"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21581-0_23"},{"journal-title":"Incisive Formal Verifier","year":"2012","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2008.4484715"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2_44"},{"year":"2007","key":"13"},{"key":"14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/11499107_13","article-title":"On finding all mnimally unsatisfiable subformulas","author":"liffiton","year":"2005","journal-title":"Int'l Conf on Theory and Applications of Satisfiability Testing"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2011.5970509"},{"key":"12","article-title":"Automated debugging of missing input constraints in a formal verification environment","author":"keng","year":"2012","journal-title":"Formal Methods in CAD"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.852031"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5693-0","author":"huang","year":"1998","journal-title":"Formal Equivalence Checking and Design Debugging"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1561\/1000000013"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103662"},{"journal-title":"Overcoming the Challenges of Formal Verification and Debug","year":"2011","author":"matsuda","key":"7"},{"journal-title":"Model checking","year":"1999","author":"clarke","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9228-4"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923234"},{"key":"9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","article-title":"Learning assumptions for compositional verification","author":"cobleigh","year":"2003","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763057"}],"event":{"name":"2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)","start":{"date-parts":[[2014,1,20]]},"location":"Singapore","end":{"date-parts":[[2014,1,23]]}},"container-title":["2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6736726\/6742831\/06742977.pdf?arnumber=6742977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T08:21:09Z","timestamp":1498119669000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6742977\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/aspdac.2014.6742977","relation":{},"subject":[],"published":{"date-parts":[[2014,1]]}}}