{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T19:38:37Z","timestamp":1761939517468,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002886","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"1298-1307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Deriving annotations for tight calculation of execution time"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Ermedahl","sequence":"first","affiliation":[]},{"given":"Jan","family":"Gustafsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"174_CR1","doi-asserted-by":"crossref","unstructured":"P. Altenbernd. On the false path problem in hard real-time programs. In Proceedings of the Eight Euromicro Workshop on Real-Time Systems, pages 102\u2013107, June 1996.","DOI":"10.1109\/EMWRTS.1996.557827"},{"key":"174_CR2","unstructured":"J. Armstrong, R. Virding, C. Wikstr\u00f6m, and M. Williams. jgn@mdh. se Concurrent programming in Erlang. Prentice Hall, 2 edition, 1996. ISBN 0-13-508301-X."},{"issue":"6","key":"174_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/173262.155095","volume":"28","author":"Fran\u00e7ois Bourdoncle","year":"1993","unstructured":"F. Bourdoncle. Abstract debugging of high-order imperative languages. In Proceedings of SIGPLAN'93 Conference on Programming Language design and Implementation, pages 46\u201355, 1993.","journal-title":"ACM SIGPLAN Notices"},{"key":"174_CR4","doi-asserted-by":"crossref","unstructured":"R. Chapman, A. Burns, and A. Wellings. Integrated program proof and worst-case timing analysis of SPARK Ada. In ACM Sigplan Workshop on Language, Compiler and Tool Support for Real-Time Systems, June 1994.","DOI":"10.1145\/192867.192873"},{"key":"174_CR5","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symp. on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"174_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In Programming Language Implementation and Logic Programming, Proceedings of the Fourth International Symposium, PLILP'92, volume Lecture Notes in Computer Science 631, pages 269\u2013295, Aug 1992.","DOI":"10.1007\/3-540-55844-6_142"},{"key":"174_CR7","unstructured":"A. Ermedahl and J. Gustavsson. Real-time industry inquiry of execution time analysis tools. Technical report, Department of Computer Systems, Uppsala University, Sweden, 1997. To be published."},{"issue":"2","key":"174_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01088803","volume":"7","author":"Marion G. Harmon","year":"1994","unstructured":"M. Harmon, T. Baker, and D. Whalley. A retargetable tecnique for predicting execution time of code segments. The Journal of Real-Time Systems, 7, 1994.","journal-title":"Real-Time Systems"},{"key":"174_CR9","unstructured":"Y.-T. Li and S. Malik. Performance analysis of embedded software using implicit path enumeration. In ACM Workshop on Lang., Comp. and Tools for RTS, May 1995."},{"key":"174_CR10","unstructured":"Y.-T. Li, S. Malik, and A. Wolfe. Cache modeling for real-time software: Beyond direct mapped instruction caches. In 17th IEEE Real-Time Systems Symposium, RTSS'96, pages 254\u2013263, 1996."},{"issue":"7","key":"174_CR11","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/32.392980","volume":"21","author":"S. Lim","year":"1995","unstructured":"S. Lim, Y. Bae, G. Jang, B.-D. Rhee, S. Min, C. Park, H. Shin, K.Park, S.-M. Moon, and C. Kim. An accurate worst case timing analysis for rise processors. IEEE Trans. on Software Engineering, 21(7):593\u2013604, July 1995.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"174_CR12","unstructured":"H. R. Nielson and F. Nielson. Semantics with Applications. John Wiley & Sons, 1992."},{"key":"174_CR13","unstructured":"G. Ottosson and M. Sj\u00f6din. Worst-case execution time analysis for modern hardware architectures. In Proc. SIGPLAN 1997 Workshop on Languages, Compilers and Tools for Real-Time Systems, June 1997. To appear."},{"key":"174_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01088696","volume":"5","author":"C. Park","year":"1993","unstructured":"C. Park. Predicting program execution times by analyzing static and dynamic program paths. The Journal of Real-Time System, 5:31\u201362, 1993.","journal-title":"The Journal of Real-Time System"},{"key":"174_CR15","doi-asserted-by":"crossref","unstructured":"C. Park and A. Shaw. Experiments with a program timing tool based on a source-level timing schema. Proceeding of 11th IEEE Real-Time Systems Symposium, pages 72\u201381, Dee 1990.","DOI":"10.1109\/REAL.1990.128731"},{"issue":"2","key":"174_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00571421","volume":"1","author":"P. Puschner","year":"1989","unstructured":"P. Puschner and C. Koza. Calculating the maximum execution time of real-time programs. The Journal of Real-Time Systems, 1(2):159\u2013176, Sep 1989.","journal-title":"The Journal of Real-Time Systems"},{"key":"174_CR17","series-title":"Technical report","volume-title":"Computing maximum task execution times with linear programming techniques","author":"P. Puschner","year":"1995","unstructured":"P. Puschner and A. Schedl. Computing maximum task execution times with linear programming techniques. Technical report, Report, Techn. Univ., Inst. f\u00fcr Technische Informatik, Vienna, April 1995."},{"key":"174_CR18","unstructured":"E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993."},{"key":"174_CR19","volume-title":"The Basis for Static Execution Time Prediction","author":"A. Vrchoticky","year":"1994","unstructured":"A. Vrchoticky. The Basis for Static Execution Time Prediction. PhD thesis, Institut f\u00fcr Technische Informatik, Technische Universit\u00e4t Wien, Austria, April 1994. *** DIRECT SUPPORT *** A0008C42 00045"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:02:44Z","timestamp":1736114564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0002886","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}