{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T08:56:04Z","timestamp":1725440164397},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/iccd.2013.6657070","type":"proceedings-article","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T17:22:16Z","timestamp":1384190536000},"page":"390-395","source":"Crossref","is-referenced-by-count":1,"title":["Selecting critical implications with set-covering formulation for SAT-based Bounded Model Checking"],"prefix":"10.1109","author":[{"given":"Mahmoud","family":"Elbayoumi","sequence":"first","affiliation":[]},{"given":"Michael S.","family":"Hsiao","sequence":"additional","affiliation":[]},{"given":"Mustafa","family":"ElNainay","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Static logic implication with application to redundancy identification","author":"zhao","year":"1997","journal-title":"Proc VTS"},{"key":"17","article-title":"Checking safety properties using induction and a SAT-Solver","author":"sheeran","year":"2000","journal-title":"Proc FMCAD"},{"key":"18","article-title":"Applying SAT methods in unbounded symbolic model checking","author":"mcmillan","year":"2002","journal-title":"Proc CAV"},{"key":"15","article-title":"Bounded model checking using satisfiability solving","author":"edmund","year":"2001","journal-title":"Formal Methods in System Design"},{"key":"16","article-title":"An incremental algorithm to check satisfiability for bounded model checking","author":"jin","year":"2004","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2483028.2483128"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2006.229206"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391605"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312024"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"20"},{"journal-title":"Survey of Approximation Algorithms for Set Cover Problem","year":"2009","author":"dutta","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/185675.306789"},{"journal-title":"VT HokieOne (SGI UV)","year":"0","key":"24"},{"year":"0","key":"25"},{"journal-title":"SATLIB","year":"0","key":"26"},{"journal-title":"Minisat 2 0","year":"0","key":"27"},{"key":"3","article-title":"Backward multiple time-frame expansion for accelerating sequential SAT","author":"torii","year":"2012","journal-title":"Proc SASIMI"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309942"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382542"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2009.5377610"},{"key":"7","article-title":"Increasing the deducibility in CNF instances for efficient SAT-based bounded model checking","author":"vimjam","year":"2005","journal-title":"Proc HLDVT"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2005.53"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICVD.2004.1261028"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-01748-3_15","article-title":"Hybrid BDD and All-SAT method for model checking, from formal to natural","author":"yadgar","year":"2009","journal-title":"Lecture Notes in Computer Science"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44798-9_4","article-title":"Pruning techniques for the SAT-based bounded model checking problem","author":"strichman","year":"2001","journal-title":"Proc Correct Hardware Design and Verification Methods"},{"key":"8","article-title":"Tuning SAT checkers for bounded model checking","author":"strichman","year":"2000","journal-title":"Proc CAV"}],"event":{"name":"2013 IEEE 31st International Conference on Computer Design (ICCD)","start":{"date-parts":[[2013,10,6]]},"location":"Asheville, NC, USA","end":{"date-parts":[[2013,10,9]]}},"container-title":["2013 IEEE 31st International Conference on Computer Design (ICCD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6644329\/6657009\/06657070.pdf?arnumber=6657070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T21:45:56Z","timestamp":1498081556000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6657070\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/iccd.2013.6657070","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}