{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:54:35Z","timestamp":1742403275235,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/emrts.2002.1019185","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T22:04:13Z","timestamp":1056578653000},"page":"50-59","source":"Crossref","is-referenced-by-count":15,"title":["Scope-tree: a program representation for symbolic worst-case execution time analysis"],"prefix":"10.1109","author":[{"given":"A.","family":"Colin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Bernat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"MATHEMATICA A System for Doing Mathematics by Computer","year":"1988","author":"wolfram","key":"19"},{"key":"17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1007905003094","article-title":"Computing maximum task execution times - A graph based approach","volume":"13","author":"puschner","year":"1997","journal-title":"Proc of IEEE Real-Time Systems Symposium"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/384198.384230"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008119029962"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00571421"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01088696"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/2.76286"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1994.342726"},{"key":"12","article-title":"Worst-case execution time analysis for modern hardware architectures","author":"ottosson","year":"0","journal-title":"ACM SIGPLAN Workshop on Languages Compilers and Tools Support for Real-Time Systems (LCTRTS'97) June 1997"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-7386-9"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(94)90004-3"},{"key":"1","article-title":"An approach to symbolic worst-case execution time analysis","author":"bernat","year":"0","journal-title":"25th Workshop on Real-time Programming Palma Spain May 2000"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/216633.216666"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.2000.896006"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2001.934029"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2001.933995"},{"key":"4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/A:1008149332687","article-title":"Worst case execution time analysis for a processor with branch prediction","volume":"18","author":"colin","year":"2000","journal-title":"Real-Time Systems"},{"key":"9","first-page":"11","article-title":"A general approach for tight timing predictions of non-rectangular loops","author":"healy","year":"1999","journal-title":"WIP Proceedings of the 1999 Real-Time Technology and Applications Symposium"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/RTTAS.1998.683183"}],"event":{"name":"14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002","acronym":"EMRTS-02","location":"Vienna, Austria"},"container-title":["Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7939\/21892\/01019185.pdf?arnumber=1019185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:41:16Z","timestamp":1497566476000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1019185\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/emrts.2002.1019185","relation":{},"subject":[]}}