{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T01:51:59Z","timestamp":1761789119199},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/tcad.2013.2263036","type":"journal-article","created":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T18:02:04Z","timestamp":1379354524000},"page":"1609-1622","source":"Crossref","is-referenced-by-count":11,"title":["Path-Directed Abstraction and Refinement for SAT-Based Design Debugging"],"prefix":"10.1109","volume":"32","author":[{"given":"Brian","family":"Keng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Veneris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","author":"clarke","year":"1999","journal-title":"Model checking"},{"key":"ref30","first-page":"502","article-title":"An extensible SAT-solver","author":"e\ufffdn","year":"2003","journal-title":"Proc Int Conf Theory Appl Satisfiability Test"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775927"},{"key":"ref11","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":"ref12","author":"jha","year":"2002","journal-title":"Testing of Digital Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.852031"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2013998"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923234"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2030593"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2011.5722237"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061370"},{"key":"ref19","first-page":"63","article-title":"Post-silicon fault localisation using maximum satisfiability and backbones","author":"zhu","year":"2011","journal-title":"Proc Int Conf Formal Methods Comput -Aided Des"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.829807"},{"key":"ref4","year":"2009","journal-title":"IEEE Standard for System Verilog Unified Hardware Design Specification and Verification Language"},{"key":"ref27","year":"2009","journal-title":"Handbook of Satisfiability (Frontiers in Artificial Intelligence and Applications Series vol 185)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0302-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630082"},{"key":"ref29","first-page":"15","article-title":"On computing backbones of propositional theories","author":"marques-silva","year":"2010","journal-title":"Proc Eur Conf Artif Intell"},{"key":"ref5","year":"2010","journal-title":"IEEE Standard for Property Specification Language (PSL)"},{"key":"ref8","first-page":"1","article-title":"Interpolation and SAT-based model checking","author":"mcmillan","year":"2003","journal-title":"Proc 1st Conf Computer-aided Verification"},{"key":"ref7","volume":"58","author":"biere","year":"2003","journal-title":"Advances in Computers"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9228-4"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-18275-4_7","article-title":"SAT-based model checking without unrolling","author":"bradley","year":"2011","journal-title":"Proc Int Conf Verification Model Checking Abstract Interpretation"},{"key":"ref1","author":"foster","year":"2011","journal-title":"From volume to velocity The transforming landscape in function verification"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228530"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2011.5722204"},{"key":"ref21","year":"2007"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560184"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/43.3141"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2011.2142407"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","article-title":"Translating pseudo-Boolean constraints into SAT","volume":"2","author":"e\ufffdn","year":"2006","journal-title":"J Satisfiability Boolean Model Comput"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6600826\/06601029.pdf?arnumber=6601029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:27Z","timestamp":1638218427000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6601029\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":31,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2013.2263036","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}