{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T17:18:03Z","timestamp":1718039883236},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"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":[[2012,8]]},"DOI":"10.1109\/tcad.2012.2190067","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T11:57:53Z","timestamp":1342180673000},"page":"1275-1287","source":"Crossref","is-referenced-by-count":23,"title":["Testability-Driven Statistical Path Selection"],"prefix":"10.1109","volume":"31","author":[{"given":"Jaeyong","family":"Chung","sequence":"first","affiliation":[]},{"given":"Jinjun","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Zolotov","sequence":"additional","affiliation":[]},{"given":"Jacob A.","family":"Abraham","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/43.88928"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1550","DOI":"10.1109\/43.331411","article-title":"RESIST: A recursive test pattern generation algorithm for path delay faults considering various test classes","volume":"13","author":"fuchs","year":"1994","journal-title":"IEEE Trans Comput -Aided Des Integr Circuits Syst"},{"key":"ref12","first-page":"183","article-title":"Clause form conversions for Boolean circuits","volume":"3542","author":"jackson","year":"2004","journal-title":"Proc SAT"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/343647.343801"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923241"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1514932.1514973"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1996.557048"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72788-0_3"},{"key":"ref18","first-page":"561","article-title":"Efficient algorithms for computing the longest viable path in a combinational network","author":"mcgeer","year":"2006","journal-title":"Proc Des Autom Conf"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/589411.589413"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/VTS.2009.50"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681642"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1993.470604"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.2.145"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2011.5722192"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2007.378639"},{"key":"ref7","first-page":"333","article-title":"An extensible SAT-solver","author":"en","year":"2004","journal-title":"Proc Int Conf Theory Applicat Satisfiability Testing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2003.159746"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-010-5146-y"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.187"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.2002.1041853"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.862751"},{"key":"ref21","first-page":"115","article-title":"On the complexity of derivation in propositional calculus","author":"tseitin","year":"1968","journal-title":"Stud Constr Math Math Logic Part 2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687419"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2008.4484830"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1146929"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/6238386\/06238392.pdf?arnumber=6238392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:01Z","timestamp":1633909921000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6238392\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":27,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2012.2190067","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}