{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:49Z","timestamp":1750306369861,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T00:00:00Z","timestamp":1481587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF I\/UCRC for Embedded Systems at SIUC","award":["NSF IIP 1432026, and NSF IIP 1361847"],"award-info":[{"award-number":["NSF IIP 1432026, and NSF IIP 1361847"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2017,1,31]]},"abstract":"<jats:p>A Monte Carlo-based approach is proposed capable of identifying in a non-enumerative and scalable manner the distributions that describe the delay of every path in a combinational circuit. Furthermore, a scalable approach to select critical paths from a potentially exponential number of path candidates is presented. Paths and their delay distributions are stored in Zero Suppressed Binary Decision Diagrams. Experimental results on some of the largest ISCAS-89 and ITC-99 benchmarks shows that the proposed method is highly scalable and effective.<\/jats:p>","DOI":"10.1145\/2940327","type":"journal-article","created":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T13:29:02Z","timestamp":1481635742000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-enumerative Generation of Path Delay Distributions and Its Application to Critical Path Selection"],"prefix":"10.1145","volume":"22","author":[{"given":"Ahish Mysore","family":"Somashekar","sequence":"first","affiliation":[{"name":"Southern Illinois University, Carbondale, IL"}]},{"given":"Spyros","family":"Tragoudas","sequence":"additional","affiliation":[{"name":"Southern Illinois University, Carbondale, IL"}]},{"given":"Rathish","family":"Jayabharathi","sequence":"additional","affiliation":[{"name":"Intel Corporation, Folsom, CA"}]},{"given":"Sreenivas","family":"Gangadhar","sequence":"additional","affiliation":[{"name":"Intel Corporation, Austin, TX"}]}],"member":"320","published-online":{"date-parts":[[2016,12,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/996070.1009993"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907047"},{"volume-title":"Proceedings of the 28th VLSI Test Symposium (VTS). 9--14","author":"Christou K.","key":"e_1_2_1_3_1","unstructured":"K. Christou , M. K. Michael , and S. Neophytou . 2010. Identification of critical primitive path delay faults without any path enumeration . In Proceedings of the 28th VLSI Test Symposium (VTS). 9--14 . K. Christou, M. K. Michael, and S. Neophytou. 2010. Identification of critical primitive path delay faults without any path enumeration. In Proceedings of the 28th VLSI Test Symposium (VTS). 9--14."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2190067"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2208661"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/343647.343801"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.21819"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.852674"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/157485.164890"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/787258.787474"},{"volume-title":"Proceedings of the IEEE International Test Conference. 376--384","author":"Murakami Atsushi","key":"e_1_2_1_11_1","unstructured":"Atsushi Murakami , Seiji Kajihara , Tsutomu Sasao , Irith Pomeranz , and Sudhakar M. Reddy . 2000. Selection of potentially testable path delay faults for test generation . In Proceedings of the IEEE International Test Conference. 376--384 . Atsushi Murakami, Seiji Kajihara, Tsutomu Sasao, Irith Pomeranz, and Sudhakar M. Reddy. 2000. Selection of potentially testable path delay faults for test generation. In Proceedings of the IEEE International Test Conference. 376--384."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.839488(410) 24"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the IEEE International Test Conference. 592--601","author":"Qiu Wangqi","year":"2003","unstructured":"Wangqi Qiu and D. M. H. Walker . 2003 . An efficient algorithm for finding the k longest testable paths through each gate in a combinational circuit . In Proceedings of the IEEE International Test Conference. 592--601 . Wangqi Qiu and D. M. H. Walker. 2003. An efficient algorithm for finding the k longest testable paths through each gate in a combinational circuit. In Proceedings of the IEEE International Test Conference. 592--601."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024648227669"},{"volume-title":"Proceedings of the International Test Conference. 974--982","author":"Sharma M.","key":"e_1_2_1_15_1","unstructured":"M. Sharma and J. H. Patel . 2002. Finding a small set of longest testable paths that cover every gate . In Proceedings of the International Test Conference. 974--982 . M. Sharma and J. H. Patel. 2002. Finding a small set of longest testable paths that cover every gate. In Proceedings of the International Test Conference. 974--982."},{"volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 190--195","author":"Singhee A.","key":"e_1_2_1_16_1","unstructured":"A. Singhee , S. Singhal , and R. A. Rutenbar . 2008. Practical, fast Monte Carlo statistical static timing analysis: Why and how . In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 190--195 . A. Singhee, S. Singhal, and R. A. Rutenbar. 2008. Practical, fast Monte Carlo statistical static timing analysis: Why and how. In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. 190--195."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.892858"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2012.6378700"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2015.7357174"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1986.1270174"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2108030"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.835137"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2843514"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2043570"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940327","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2940327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:27Z","timestamp":1750222587000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2940327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,13]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1,31]]}},"alternative-id":["10.1145\/2940327"],"URL":"https:\/\/doi.org\/10.1145\/2940327","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2016,12,13]]},"assertion":[{"value":"2015-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}