{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T08:43:56Z","timestamp":1743497036912},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214363"},{"type":"electronic","value":"9783642214370"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21437-0_27","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T07:33:16Z","timestamp":1308382396000},"page":"353-368","source":"Crossref","is-referenced-by-count":17,"title":["Simulating Concurrent Behaviors with Worst-Case Cost Bounds"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"G\u00f3mez-Zamalloa","sequence":"additional","affiliation":[]},{"given":"Einar Broch","family":"Johnsen","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Schlatte","sequence":"additional","affiliation":[]},{"given":"S. Lizeth Tapia","family":"Tarifa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"27_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10817-010-9174-1","volume":"42","author":"E. Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning\u00a042(6), 161\u2013203 (2011)","journal-title":"Journal of Automated Reasoning"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-71316-6_12","volume-title":"Programming Languages and Systems","author":"E. Albert","year":"2007","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of java bytecode. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 157\u2013172. Springer, Heidelberg (2007)"},{"key":"27_CR3","volume-title":"LCTES","author":"E. Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., Zanardini, D.: Task-Level Analysis for a Language with Async-Finish parallelism. In: LCTES. ACM Press, New York (2011)"},{"key":"27_CR4","volume-title":"ISMM","author":"E. Albert","year":"2010","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M.: Parametric Inference of Memory Requirements for Garbage Collected Languages. In: ISMM. ACM Press, New York (2010)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M., Johnsen, E.B., Schlatte, R., Tapia Tarifa, S.L.: Simulating concurrent behaviors with worst-case cost bounds. Research Report 403, Dept. of Informatics, Univ. of Oslo (January 2011), http:\/\/einarj.at.ifi.uio.no\/Papers\/rr403.pdf","DOI":"10.1007\/978-3-642-21437-0_27"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-62718-9_12","volume-title":"Logic Program Synthesis and Transformation","author":"F. Benoy","year":"1997","unstructured":"Benoy, F., King, A.: Inferring Argument Size Relationships with CLP(R). In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 204\u2013223. Springer, Heidelberg (1997)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991","author":"A. Bossi","year":"1991","unstructured":"Bossi, A., Cocco, N., Fabris, M.: Proving Termination of Logic Programs by Exploiting Term Properties. In: Abramsky, S. (ed.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol.\u00a0494. Springer, Heidelberg (1991)"},{"key":"27_CR8","volume-title":"A Theory of Distributed Object","author":"D. Caromel","year":"2005","unstructured":"Caromel, D., Henrio, L.: A Theory of Distributed Object. Springer, Heidelberg (2005)"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/1094811.1094852","volume-title":"OOPSLA","author":"P. Charles","year":"2005","unstructured":"Charles, P., Grothoff, C., Saraswat, V.A., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., Sarkar, V.: X10: An Object-Oriented Approach to Non-Uniform Cluster computing. In: OOPSLA, pp. 519\u2013538. ACM, New York (2005)"},{"key":"27_CR10","series-title":"LNCS","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L.: All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350. Springer, Heidelberg (2007)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-71316-6_22","volume-title":"Programming Languages and Systems","author":"F.S. Boer de","year":"2007","unstructured":"de Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 316\u2013330. Springer, Heidelberg (2007)"},{"key":"27_CR12","volume-title":"POPL","author":"S. Gulwani","year":"2009","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: Precise and Efficient Static Estimation of Program Computational Complexity. In: POPL. ACM, New York (2009)"},{"key":"27_CR13","first-page":"357","volume-title":"POPL","author":"J. Hoffmann","year":"2011","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. In: POPL, pp. 357\u2013370. ACM, New York (2011)"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10270-006-0011-2","volume":"6","author":"E.B. Johnsen","year":"2007","unstructured":"Johnsen, E.B., Owe, O.: An asynchronous communication model for distributed concurrent objects. Software and Systems Modeling\u00a06(1), 35\u201358 (2007)","journal-title":"Software and Systems Modeling"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-642-16901-4_42","volume-title":"Formal Methods and Software Engineering","author":"E.B. Johnsen","year":"2010","unstructured":"Johnsen, E.B., Owe, O., Schlatte, R., Tapia Tarifa, S.L.: Dynamic resource reallocation between deployment components. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol.\u00a06447, pp. 646\u2013661. Springer, Heidelberg (2010)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-17164-2_20","volume-title":"Programming Languages and Systems","author":"M. Kero","year":"2010","unstructured":"Kero, M., Pietrzak, P., Nordlander, J.: Live heap space bounds for real-time systems. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol.\u00a06461, pp. 287\u2013303. Springer, Heidelberg (2010)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"K\u00fcnzli, S., Poletti, F., Benini, L., Thiele, L.: Combining simulation and formal methods for system-level performance analysis. In: DATE. European Design and Automation Association, pp. 236\u2013241 (2006)","DOI":"10.1109\/DATE.2006.244109"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science\u00a096, 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"27_CR19","first-page":"17","volume":"61","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming\u00a061, 17\u2013139 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"27_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28901-1","volume-title":"Software Product Line Engineering: Foundations, Principles, and Techniques","author":"K. Pohl","year":"2005","unstructured":"Pohl, K., B\u00f6ckle, G., Van Der Linden, F.: Software Product Line Engineering: Foundations, Principles, and Techniques. Springer, Heidelberg (2005)"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-14107-2_13","volume-title":"ECOOP 2010 \u2013 Object-Oriented Programming","author":"J. Sch\u00e4fer","year":"2010","unstructured":"Sch\u00e4fer, J., Poetzsch-Heffter, A.: JCoBox: Generalizing active objects to concurrent components. In: D\u2019Hondt, T. (ed.) ECOOP 2010. LNCS, vol.\u00a06183, pp. 275\u2013299. Springer, Heidelberg (2010)"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11813040_11","volume-title":"FM 2006: Formal Methods","author":"M. Verhoef","year":"2006","unstructured":"Verhoef, M., Larsen, P.G., Hooman, J.: Modeling and validating distributed embedded real-time systems with VDM++. In: Misra, J., Nipkow, T., Karakostas, G. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 147\u2013162. Springer, Heidelberg (2006)"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Wegbreit, B.: Mechanical Program Analysis. Comm. of the ACM\u00a018(9) (1975)","DOI":"10.1145\/361002.361016"},{"key":"27_CR24","first-page":"439","volume-title":"Proc. OOPSLA 2005","author":"A. Welc","year":"2005","unstructured":"Welc, A., Jagannathan, S., Hosking, A.: Safe futures for Java. In: Proc. OOPSLA 2005, pp. 439\u2013453. ACM Press, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","FM 2011: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21437-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T13:31:02Z","timestamp":1686144662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21437-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214363","9783642214370"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21437-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}