{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:48:57Z","timestamp":1761580137032},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/test.2002.1041853","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T23:36:53Z","timestamp":1056584213000},"page":"974-982","source":"Crossref","is-referenced-by-count":46,"title":["Finding a small set of longest testable paths that cover every gate"],"prefix":"10.1109","author":[{"given":"M.","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.H.","family":"Patel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.2001.966683"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/43.511566"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1996.557046"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.2000.894228"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008355411566"},{"key":"13","first-page":"159","article-title":"Delay testing lsi logic","author":"shedletsky","year":"0","journal-title":"The Eigth Annual International Conference on Fault-Tolerance Computing 1978"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/VTEST.1998.670868"},{"key":"11","article-title":"Long path enumeration algorithms for timing verification on large digital systems","author":"asano","year":"1985","journal-title":"Graph Theory with Applications to Algorithms and Computer Science"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(94)90018-3"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.2000.894227"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/92.894166"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1988.14749"},{"journal-title":"Introuduction to Algorithms","year":"1993","author":"corme","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/43.331411"},{"key":"6","article-title":"On selecting testable paths in scan designs","author":"shao","year":"0","journal-title":"IEEE European Test Workshop 2002"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1990.114911"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/54.20389"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ICVD.1997.567965"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1997.643606"}],"event":{"name":"2002 International Test Conference","acronym":"TEST-02","location":"Baltimore, MD, USA"},"container-title":["Proceedings. International Test Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8073\/22329\/01041853.pdf?arnumber=1041853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T21:27:37Z","timestamp":1489440457000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1041853\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/test.2002.1041853","relation":{},"subject":[]}}