{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:16:16Z","timestamp":1725524176666},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/emsoft.2013.6658593","type":"proceedings-article","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T10:52:14Z","timestamp":1385031134000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Path-sensitive resource analysis compliant with assertions"],"prefix":"10.1109","author":[{"given":"Duc-Hiep","family":"Chu","sequence":"first","affiliation":[]},{"given":"Joxan","family":"Jaffar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008138407139"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/1356058.1356066"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90020-5"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008141130870"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217570"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/129393.129398"},{"key":"16","first-page":"297","article-title":"Efficient memoization for dynamic programming with ad-hoc constraints","author":"jaffar","year":"2008","journal-title":"AAAI"},{"key":"13","article-title":"Algorithms for infeasible path calculation","author":"gustafsson","year":"2006","journal-title":"WCET"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926427"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806630"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/WORDS.2005.53"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69738-1_25"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/2038642.2038692"},{"year":"2006","key":"20"},{"journal-title":"Bound-T Time and Stack Analyser","year":"0","key":"2"},{"journal-title":"aiT Worst-Case Execution Time Analyzers","year":"0","key":"1"},{"key":"10","first-page":"405","article-title":"On the limits of the classical approach to cost analysis","author":"esteban","year":"2012","journal-title":"SAS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.2000.896006"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.2307\/2963594"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/951710.951720"},{"key":"8","first-page":"1298","article-title":"Deriving annotations for tight calculation of execution time","author":"ermedahl","year":"1997","journal-title":"Euro-Par"}],"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\/06658593.pdf?arnumber=6658593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:38:12Z","timestamp":1490218692000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6658593\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/emsoft.2013.6658593","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}