{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T02:00:55Z","timestamp":1789956055421,"version":"4.0.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319109350","type":"print"},{"value":"9783319109367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10936-7_2","type":"book-chapter","created":{"date-parts":[[2014,9,6]],"date-time":"2014-09-06T15:17:55Z","timestamp":1410016675000},"page":"18-33","source":"Crossref","is-referenced-by-count":10,"title":["Peak Cost Analysis of Distributed Systems"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jes\u00fas","family":"Correas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillermo","family":"Rom\u00e1n-D\u00edez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Barik, R., Sarkar, V., Shyamasundar, R.K.: May-happen-in-parallel analysis of x10 programs. In: Yelick, K.A., Mellor-Crummey, J.M. (eds.) PPOPP, pp. 183\u2013193. ACM (2007)","DOI":"10.1145\/1229428.1229471"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Flores-Montoya, A., Genaim, S., G\u00f3mez-Zamalloa, M., Martin-Martin, E., Puebla, G., Rom\u00e1n-D\u00edez, G.: SACO: Static Analyzer for Concurrent Objects. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol.\u00a08413, pp. 562\u2013567. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54862-8_46"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-25318-8_19","volume-title":"Programming Languages and Systems","author":"E. Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G.: Cost Analysis of Concurrent OO programs. In: Yang, H. (ed.) APLAS 2011. LNCS, vol.\u00a07078, pp. 238\u2013254. Springer, Heidelberg (2011)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Genaim, S., Zanardini, D.: Task-Level Analysis for a Language with Async-Finish parallelism. In: Proc. of LCTES 2011, pp. 21\u201330. ACM Press (2011)","DOI":"10.1145\/1967677.1967681"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Albert, E., Flores-Montoya, A.E., Genaim, S.: Analysis of May-Happen-in-Parallel in Concurrent Objects. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE 2012. LNCS, vol.\u00a07273, pp. 35\u201351. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30793-5_3"},{"issue":"9","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1016\/j.scico.2012.10.008","volume":"78","author":"E. Albert","year":"2013","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M.: Heap Space Analysis for Garbage Collected Languages. Science of Computer Programming\u00a078(9), 1427\u20131448 (2013)","journal-title":"Science of Computer Programming"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-69330-7_11","volume-title":"Languages and Compilers for Parallel Computing","author":"R. Barik","year":"2006","unstructured":"Barik, R.: Efficient computation of may-happen-in-parallel information for concurrent java programs. In: Ayguad\u00e9, E., Baumgartner, G., Ramanujam, J., Sadayappan, P. (eds.) LCPC 2005. LNCS, vol.\u00a04339, pp. 152\u2013169. Springer, Heidelberg (2006)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Farzan, A., Kincaid, Z., Podelski, A.: Inductive data flow graphs. In: POPL, pp. 129\u2013142. ACM (2013)","DOI":"10.1145\/2480359.2429086"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: Precise and Efficient Static Estimation of Program Computational Complexity. In: Proc. of POPL 2009, pp. 127\u2013139. ACM (2009)","DOI":"10.1145\/1594834.1480898"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate Amortized Resource Analysis. In: Proc. of POPL 2011, pp. 357\u2013370. ACM (2011)","DOI":"10.1145\/1925844.1926427"},{"issue":"5","key":"2_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1837853.1693459","volume":"45","author":"J.K. Lee","year":"2010","unstructured":"Lee, J.K., Palsberg, J.: Featherweight x10: A core calculus for async-finish parallelism. SIGPLAN Not.\u00a045(5), 25\u201336 (2010)","journal-title":"SIGPLAN Not."},{"key":"2_CR12","unstructured":"Lee, J.K., Palsberg, J., Majumdar, R.: Complexity results for may-happen-in-parallel analysis (2010) (manuscript)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044834.1044835","volume":"14","author":"A. Milanova","year":"2005","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Parameterized Object Sensitivity for Points-to Analysis for Java. ACM Trans. Softw. Eng. Methodol.\u00a014, 1\u201341 (2005)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Shapiro, M., Horwitz, S.: Fast and Accurate Flow-Insensitive Points-To Analysis. In: Proc. of POPL 1997, Paris, France, pp. 1\u201314. ACM (January 1997)","DOI":"10.1145\/263699.263703"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Smaragdakis, Y., Bravenboer, M., Lhot\u00e1k, O.: Pick your Contexts Well: Understanding Object-Sensitivity. In: Proc. of POPL 2011, pp. 17\u201330. ACM (2011)","DOI":"10.1145\/1925844.1926390"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for Java. In: PLDI, pp. 387\u2013400 (2006)","DOI":"10.1145\/1133255.1134027"},{"issue":"9","key":"2_CR17","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/361002.361016","volume":"18","author":"B. Wegbreit","year":"1975","unstructured":"Wegbreit, B.: Mechanical Program Analysis. Communications ACM\u00a018(9), 528\u2013539 (1975)","journal-title":"Communications ACM"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-23702-7_22","volume-title":"Static Analysis","author":"F. Zuleger","year":"2011","unstructured":"Zuleger, F., Gulwani, S., Sinn, M., Veith, H.: Bound analysis of imperative programs with the size-change abstraction. In: Yahav, E. (ed.) Static Analysis. LNCS, vol.\u00a06887, pp. 280\u2013297. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10936-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:12:03Z","timestamp":1558987923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10936-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319109350","9783319109367"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10936-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}