{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:21:51Z","timestamp":1725758511145},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452833"},{"type":"electronic","value":"9783642452840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45284-0_4","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T00:54:34Z","timestamp":1385340874000},"page":"43-59","source":"Crossref","is-referenced-by-count":3,"title":["A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction"],"prefix":"10.1007","author":[{"given":"V\u00edtor","family":"Rodrigues","sequence":"first","affiliation":[]},{"given":"Benny","family":"Akesson","sequence":"additional","affiliation":[]},{"given":"Sim\u00e3o","family":"Melo de Sousa","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Akesson, B., Hansson, A., Goossens, K.: Composable resource sharing based on latency-rate servers. In: Proc. DSD (2009)","DOI":"10.1109\/DSD.2009.167"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Formal Methods in Programming and Their Applications","author":"F. Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Pottosin, I.V., Bjorner, D., Broy, M. (eds.) FMP&TA 1993. LNCS, vol.\u00a0735, pp. 128\u2013141. Springer, Heidelberg (1993)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Elec. Notes in Theoretical Computer Science, 6 (1997)","DOI":"10.1016\/S1571-0661(05)80168-9"},{"key":"4_CR4","series-title":"NATO ASI Series F","volume-title":"Calculational System Design","author":"P. Cousot","year":"1999","unstructured":"Cousot, P.: The calculational design of a generic abstract interpreter. In: Broy, M., Steinbr\u00fcggen, R. (eds.) Calculational System Design. NATO ASI Series F. IOS Press, Amsterdam (1999)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Journal of Logic Programming\u00a013(2-3) (1992)","DOI":"10.1016\/0743-1066(92)90030-7"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. POPL (1977)","DOI":"10.1145\/512950.512973"},{"key":"4_CR7","unstructured":"Cullmann, C., Ferdinand, C., Gebhard, G., Grund, D., Maiza, C., Reineke, J., Triquet, B., Wilhelm, R.: Predictability considerations in the design of multi-core embedded systems. In: Proc. ERTS (2010)"},{"key":"4_CR8","unstructured":"Engblom, J., Ermedahl, A., Stappert, F.: A worst-case execution-time analysis tool prototype for embedded real-time systems. In: Proc. RT-TOOLS (2001)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Kelter, T., Falk, H., Marwedel, P., Chattopadhyay, S., Roychoudhury, A.: Bus-aware multicore wcet analysis through tdma offset bounds. In: Proc. ECRTS (2011)","DOI":"10.1109\/ECRTS.2011.9"},{"key":"4_CR10","unstructured":"Kleene, S.C.: Introduction to metamathematics. Van Nostrand (1952)"},{"key":"4_CR11","unstructured":"M\u00e4lardalen\u00a0WCET research group, \n                  \n                    http:\/\/www.mrtc.mdh.se\/projects\/wcet"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-32495-6_7","volume-title":"Foundational and Practical Aspects of Resource Analysis","author":"V. Rodrigues","year":"2012","unstructured":"Rodrigues, V., Pedroso, J.P., Florido, M., de Sousa, S.M.: Certifying execution time. In: Pe\u00f1a, R., van Eekelen, M., Shkaravska, O. (eds.) FOPARA 2011. LNCS, vol.\u00a07177, pp. 108\u2013125. Springer, Heidelberg (2012)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Rodrigues, V.: A declarative compositional timing analysis for multicores using the latency-rate abstraction. Technical report, LIACC, Faculty of Computer Science, University of Porto (2012), \n                  \n                    http:\/\/www.dcc.fc.up.pt\/~vitor.rodrigues","DOI":"10.1007\/978-3-642-45284-0_4"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-22531-4_6","volume-title":"Functional and Constraint Logic Programming","author":"V. Rodrigues","year":"2011","unstructured":"Rodrigues, V., Florido, M., de Sousa, S.M.: A functional approach to worst-case execution time analysis. In: Kuchen, H. (ed.) WFLP 2011. LNCS, vol.\u00a06816, pp. 86\u2013103. Springer, Heidelberg (2011)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Schneider, J., Ferdinand, C.: Pipeline behavior prediction for superscalar processors by abstract interpretation. ACM SIGPLAN Not.\u00a034 (1999)","DOI":"10.1145\/315253.314432"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Shah, H., Knoll, A., Akesson, B.: Bounding SDRAM Interference: Detailed Analysis vs. Latency-Rate Analysis. In: Proc. DATE, pp. 308\u2013313 (2013)","DOI":"10.7873\/DATE.2013.075"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Stiliadis, D., Varma, A.: Latency-rate servers: a general model for analysis of traffic scheduling algorithms. IEEE\/ACM T. Netw.\u00a06(5) (1998)","DOI":"10.1109\/90.731196"},{"key":"4_CR18","unstructured":"Stoy, J.E.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press (1977)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Wiggers, M., Bekooij, M., Smit, G.: Modelling run-time arbitration by latency-rate servers in dataflow graphs. In: Proc. SCOPES, pp. 11\u201322 (2007)","DOI":"10.1145\/1269843.1269846"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-24622-0_25","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R. Wilhelm","year":"2004","unstructured":"Wilhelm, R.: Why ai + ilp is good for wcet, but mc is not, nor ilp alone. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 309\u2013322. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45284-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T17:58:29Z","timestamp":1558720709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45284-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452833","9783642452840"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45284-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}