{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:34:12Z","timestamp":1729614852661,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/ddecs.2011.5783055","type":"proceedings-article","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T13:09:21Z","timestamp":1307452161000},"page":"93-98","source":"Crossref","is-referenced-by-count":12,"title":["SAT-based analysis of sensitisable paths"],"prefix":"10.1109","author":[{"given":"Matthias","family":"Sauer","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Czutro","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Schubert","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Hillebrecht","sequence":"additional","affiliation":[]},{"given":"Ilia","family":"Polian","sequence":"additional","affiliation":[]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ETSYM.2010.5512789"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1995.529895"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/43.644620"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.2003.1271091"},{"key":"ref14","article-title":"On the Complexity of Derivations in Propositional Calculus","author":"tseitin","year":"1968","journal-title":"Studies in Constructive Mathematics and Mathematical Logics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1989.82368"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI.Design.2009.20"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/43.536723"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923107"},{"key":"ref19","article-title":"Antom—Solver Description","author":"schubert","year":"2010","journal-title":"SAT Race"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2010.24"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/MDT.2006.148","volume":"23","author":"authors","year":"2006","journal-title":"IEEE Design ETest of Computers"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/VDAT.2008.4542416"},{"key":"ref5","first-page":"192","article-title":"Diagnosis of Hold Time Defects","author":"wang","year":"2004","journal-title":"IEEE Int'l Conf on Computer Design"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.2005.1584089"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/43.559333"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/VTS.2010.5469619"},{"key":"ref1","first-page":"592","article-title":"An Efficient Algorithm for Finding the K Longest Testable Paths Through Each Gate in a Combinational Circuit","author":"qiu","year":"2003","journal-title":"Int Test Conf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ETS.2008.19"}],"event":{"name":"Systems (DDECS)","start":{"date-parts":[[2011,4,13]]},"location":"Cottbus, Germany","end":{"date-parts":[[2011,4,15]]}},"container-title":["14th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5771301\/5783023\/05783055.pdf?arnumber=5783055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T21:14:55Z","timestamp":1497906895000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5783055\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ddecs.2011.5783055","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}