{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:58:12Z","timestamp":1740131892425,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100004807","name":"DFG","doi-asserted-by":"publisher","award":["BE 1176-15\/2","PO 1220-2\/2"],"award-info":[{"award-number":["BE 1176-15\/2","PO 1220-2\/2"]}],"id":[{"id":"10.13039\/100004807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2016,6,1]]},"DOI":"10.1109\/tc.2015.2458869","type":"journal-article","created":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T14:43:12Z","timestamp":1437489792000},"page":"1869-1881","source":"Crossref","is-referenced-by-count":17,"title":["PHAETON: A SAT-Based Framework for Timing-Aware Path Sensitization"],"prefix":"10.1109","volume":"65","author":[{"given":"Matthias","family":"Sauer","sequence":"first","affiliation":[]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[]},{"given":"Ilia","family":"Polian","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.7873\/DATE.2013.100"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/54.785838"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1049\/ip-cdt:20050194"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/MDT.2002.1003792"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TEST.1997.639630"},{"year":"0","key":"ref37"},{"year":"0","key":"ref36"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/54.867894"},{"year":"0","key":"ref34"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ASPDAC.2004.1337546"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ATS.2010.61"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/DATE.2012.6176507"},{"key":"ref13","first-page":"1","article-title":"An efficient SAT-based path delay fault ATPG with an unified sensitization model","author":"lu","year":"0","journal-title":"Proc IEEE Int Test Conf"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/s10836-010-5146-y"},{"key":"ref15","volume":"185","author":"biere","year":"2009","journal-title":"Handbook of Satisfiability"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ATS.2012.35"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/978-3-642-40564-8_10"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/IOLTS.2011.5993819"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/ETS.2014.6847806"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/2429384.2429391"},{"key":"ref4","first-page":"320","article-title":"Timing-based delay test for screening small delay defects","author":"ahmed","year":"0","journal-title":"Proc 43rd Annu Des Autom Conf"},{"key":"ref27","first-page":"466","article-title":"On the complexity of derivations in propositional calculus","author":"tseitin","year":"0","journal-title":"Automation of Reasoning"},{"key":"ref3","first-page":"342","article-title":"Model for delay faults based upon paths","author":"smith","year":"0","journal-title":"Proc IEEE Int Test Conf"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/ATS.2006.261012"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1023\/A:1024648227669"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/0167-9260(94)90018-3"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TCAD.2012.2190067"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/VTS.2008.32"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/DAC.2002.1012689"},{"key":"ref9","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":"0","journal-title":"Proc Int Test Conf"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TCAD.2007.907047"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ATS.2011.39"},{"key":"ref22","first-page":"192","article-title":"Diagnosis of hold time defects","author":"wang","year":"0","journal-title":"Proc IEEE Int Conf Comput Des"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TCAD.2010.2043591"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/MM.2004.85"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/VDAT.2008.4542416"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/978-90-481-3282-9_3"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/ETS.2014.6847794"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7466398\/07163550.pdf?arnumber=7163550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:44:55Z","timestamp":1641987895000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7163550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,1]]},"references-count":38,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tc.2015.2458869","relation":{},"ISSN":["0018-9340"],"issn-type":[{"type":"print","value":"0018-9340"}],"subject":[],"published":{"date-parts":[[2016,6,1]]}}}