{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T16:33:59Z","timestamp":1730219639856,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/emsoft.2013.6658594","type":"proceedings-article","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T15:52:14Z","timestamp":1385049134000},"page":"1-10","source":"Crossref","is-referenced-by-count":4,"title":["Simple analysis of partial worst-case execution paths on general control flow graphs"],"prefix":"10.1109","author":[{"given":"Jan C.","family":"Kleinsorge","sequence":"first","affiliation":[]},{"given":"Heiko","family":"Falk","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Marwedel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"},{"key":"17","first-page":"157","article-title":"Fast and precise WCET prediction by separated cache and path analyses","volume":"18","author":"theiling","year":"2000","journal-title":"RTS"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/567097.567098"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/502217.502240"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322272"},{"key":"13","article-title":"Advanced compiler design and implementation","author":"muchnick","year":"1997","journal-title":"Morgan Kaufmann"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/570886.570887"},{"key":"11","volume":"3","author":"knuth","year":"1998","journal-title":"The art of computer programming"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217570"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2008.7"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1967677.1967697"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/267959.269971"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365697"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2002.1019185"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/STFSSD.2009.12"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/262004.262005"},{"journal-title":"A Modular Tool Architecture for Worst-Case Execution Time Analysis","year":"2003","author":"ermedahl","key":"8"}],"event":{"name":"2013 International \u00a0Conference on Embedded \u00a0Software (EMSOFT)","start":{"date-parts":[[2013,9,29]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2013,10,4]]}},"container-title":["2013 Proceedings of the International Conference on Embedded Software (EMSOFT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6648479\/6658572\/06658594.pdf?arnumber=6658594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T01:38:13Z","timestamp":1490233093000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6658594\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/emsoft.2013.6658594","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}