{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:12:03Z","timestamp":1725549123582},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/rtcsa.2014.6910500","type":"proceedings-article","created":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T16:39:52Z","timestamp":1412095192000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Direct handling of infeasible paths in the event dependency analysis"],"prefix":"10.1109","author":[{"given":"Kilian","family":"Kempf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Slomka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147002"},{"key":"11","first-page":"361","article-title":"Refining data flow information using infeasible paths","author":"bodik","year":"1997","journal-title":"Software engineering-ESEC\/FSE97 6th European Software Engineering Conference Held Jointly with the 5th ACM SIGSOFT Symposium on the Foundations of Software Engineering 1301"},{"key":"12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/978-3-540-71322-7_2","article-title":"New developments in wcet analysis","author":"ferdinand","year":"2007","journal-title":"Program Analysis and Compilation Theory and Practice"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0165-6074(94)90080-9"},{"key":"2","first-page":"75","article-title":"Relaxing event densities by exploiting infeasible paths in control flow graphs","author":"kempf","year":"2011","journal-title":"RTNS"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/IES.2006.357461"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2010.5456952"},{"key":"7","article-title":"Algorithms for infeasible path calculation","author":"gustafsson","year":"2006","journal-title":"Sixth International Workshop on Worst-Case Execution Time Analysis"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/216633.216666"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(02)00454-1"},{"journal-title":"Compositional Scheduling Analysis Using Standard Event Models -The SymTA\/S Approach","year":"2005","author":"richter","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2011.23"},{"key":"8","article-title":"Analysis of path exclusion at the machine code level","author":"stein","year":"2007","journal-title":"Proceedings of 5th International Workshop on Worst-Case Execution Time Analysis"}],"event":{"name":"2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)","start":{"date-parts":[[2014,8,20]]},"location":"Chongqing, China","end":{"date-parts":[[2014,8,22]]}},"container-title":["2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6900045\/6910490\/06910500.pdf?arnumber=6910500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T17:31:50Z","timestamp":1498152710000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6910500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/rtcsa.2014.6910500","relation":{},"subject":[],"published":{"date-parts":[[2014,8]]}}}