{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:37:18Z","timestamp":1729658238613,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1109\/aspdac.2013.6509651","type":"proceedings-article","created":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T19:36:53Z","timestamp":1367609813000},"page":"533-539","source":"Crossref","is-referenced-by-count":9,"title":["Provably optimal test cube generation using quantified boolean formula solving"],"prefix":"10.1109","author":[{"given":"M.","family":"Sauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Reimer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Polian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33386-6_29"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804029"},{"key":"15","article-title":"On the complexity of derivations in propositional calculus","author":"tseitin","year":"1968","journal-title":"Studies in Constructive Mathematics and Mathematical Logics (A Slisenko Ed )"},{"key":"16","first-page":"502","article-title":"An extensible SAT-solver","author":"een","year":"2003","journal-title":"SAT"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009725216438"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"11","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2012.6176547"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/378239.378471"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/VTEST.2000.843854"},{"key":"22","first-page":"307","article-title":"Sorting networks and their applications","author":"batcher","year":"1968","journal-title":"AFIPS Spring Joint Computing Conference"},{"key":"23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","article-title":"Translating pseudo-boolean constraints into sat","volume":"2","author":"een","year":"2006","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/11499107_5","article-title":"Effective preprocessing in SAT through variable and clause elimination","volume":"3569","author":"een","year":"2005","journal-title":"Int'l Conf on Theory and Applications of Satisfiability Testing"},{"key":"25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-24730-2_3","article-title":"Minimal assignments for bounded model checking","volume":"2988","author":"ravi","year":"2004","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems"},{"key":"26","article-title":"Antom-solver description","author":"schubert","year":"2010","journal-title":"SAT Race"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2011.5783055"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2011.43"},{"key":"3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/VTEST.2000.843824","article-title":"Static compaction techniques to control scan vector power dissipation","author":"sankaralingam","year":"2000","journal-title":"VLSI Test Symposium 2000 Proceedings 18th IEEE"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.826558"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ETS.2012.6233017"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1996.545575"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/VTS.2011.5783731"},{"key":"6","first-page":"1","article-title":"Computing two-pattern test cubes for transition path delay faults","author":"pomeranz","year":"2012","journal-title":"Very Large Scale Integration (VLSI) Systems IEEE Transactions on"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681551"},{"key":"4","first-page":"1028","article-title":"Low-capture-power test generation for scan-based at-speed testing","volume":"10","author":"wen","year":"2005","journal-title":"Test Conference 2005 Proceedings ITC 2005 IEEE International"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/502175.502186"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/VTS.2008.14"}],"event":{"name":"2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC 2013)","start":{"date-parts":[[2013,1,22]]},"location":"Yokohama","end":{"date-parts":[[2013,1,25]]}},"container-title":["2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6507004\/6509548\/06509651.pdf?arnumber=6509651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T05:02:26Z","timestamp":1595739746000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6509651\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/aspdac.2013.6509651","relation":{},"subject":[],"published":{"date-parts":[[2013,1]]}}}