{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:30:52Z","timestamp":1781893852969,"version":"3.54.5"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319192482","type":"print"},{"value":"9783319192499","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19249-9_1","type":"book-chapter","created":{"date-parts":[[2015,5,23]],"date-time":"2015-05-23T07:55:31Z","timestamp":1432367731000},"page":"3-17","source":"Crossref","is-referenced-by-count":3,"title":["Resource Analysis: From Sequential to Concurrent and Distributed Programs"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jes\u00fas","family":"Correas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miguel","family":"G\u00f3mez-Zamalloa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enrique","family":"Martin-Martin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Germ\u00e1n","family":"Puebla","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":"1_CR1","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Correas, J., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G., Rom\u00e1n-D\u00edez, G.: Object-Sensitive Cost Analysis for Concurrent Objects. Software Testing, Verification and Reliability (2015), \n                        http:\/\/dx.doi.org\/10.1002\/stvr.1569","DOI":"10.1002\/stvr.1569"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-05089-3_24","volume-title":"FM 2009: Formal Methods","author":"E. Albert","year":"2009","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Field-Sensitive Value Analysis by Field-Insensitive Analysis. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 370\u2013386. Springer, Heidelberg (2009)"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10817-010-9174-1","volume":"46","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\u00a046(2), 161\u2013203 (2011)","journal-title":"Journal of Automated Reasoning"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-15769-1_9","volume-title":"Static Analysis","author":"G. Amato","year":"2010","unstructured":"Amato, G., Parton, M., Scozzari, F.: From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol.\u00a06337, pp. 100\u2013116. Springer, Heidelberg (2010)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.scico.2013.04.006","volume":"92","author":"E. Albert","year":"2014","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Rom\u00e1n-D\u00edez, G.: Conditional Termination of Loops over Heap-allocated Data. Science of Computer Programming\u00a092, 2\u201324 (2014)","journal-title":"Science of Computer Programming"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.tcs.2011.07.009","volume":"413","author":"E. Albert","year":"2012","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost Analysis of Object-Oriented Bytecode Programs. Theoretical Computer Science\u00a0413(1), 142\u2013159 (2012)","journal-title":"Theoretical Computer Science"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Albert, E., Correas, J., Puebla, G., Rom\u00e1n-D\u00edez, G.: Quantified Abstract Configurations of Distributed Systems. Formal Aspects of Computing (2015), \n                        http:\/\/dx.doi.org\/10.1007\/s00165-014-0321-z","DOI":"10.1007\/s00165-014-0321-z"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-10936-7_2","volume-title":"Static Analysis","author":"E. Albert","year":"2014","unstructured":"Albert, E., Correas, J., Rom\u00e1n-D\u00edez, G.: Peak Cost Analysis of Distributed Systems. In: M\u00fcller-Olm, M., Seidl, H. (eds.) Static Analysis. LNCS, vol.\u00a08723, pp. 18\u201333. Springer, Heidelberg (2014)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-662-46681-0_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Albert","year":"2015","unstructured":"Albert, E., Fern\u00e1ndez, J.C., Rom\u00e1n-D\u00edez, G.: Non-Cumulative Resource Analysis. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol.\u00a09035, pp. 85\u2013100. Springer, Heidelberg (2015)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-30793-5_3","volume-title":"Formal Techniques for Distributed Systems","author":"E. Albert","year":"2012","unstructured":"Albert, E., Flores-Montoya, A.E., Genaim, S.: Analysis of May-Happen-in-Parallel in Concurrent Objects. In: Giese, H., Rosu, G. (eds.) FORTE 2012 and FMOODS 2012. LNCS, vol.\u00a07273, pp. 35\u201351. Springer, Heidelberg (2012)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-319-02444-8_25","volume-title":"Automated Technology for Verification and Analysis","author":"E. Albert","year":"2013","unstructured":"Albert, E., Flores-Montoya, A., Genaim, S., Martin-Martin, E.: Termination and Cost Analysis of Loops with Concurrent Interleavings. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol.\u00a08172, pp. 349\u2013364. Springer, Heidelberg (2013)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M.: Parametric Inference of Memory Requirements for Garbage Collected Languages. In: Proc. of ISMM 2010, pp. 121\u2013130. ACM (2010)","DOI":"10.1145\/1806651.1806671"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL, pp. 84\u201396 (1978)","DOI":"10.1145\/512760.512770"},{"issue":"5","key":"1_CR14","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1145\/161468.161472","volume":"15","author":"S.K. Debray","year":"1993","unstructured":"Debray, S.K., Lin, N.W.: Cost Analysis of Logic Programs. ACM Transactions on Programming Languages and Systems\u00a015(5), 826\u2013875 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR15","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":"1_CR16","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"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-07151-0_10","volume-title":"Functional and Logic Programming","author":"J. Hoffmann","year":"2014","unstructured":"Hoffmann, J., Shao, Z.: Type-Based Amortized Resource Analysis with Integers and Arrays. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol.\u00a08475, pp. 152\u2013168. Springer, Heidelberg (2014)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: Proc. of POPL 2013, pp. 185\u2013197. ACM (2003)","DOI":"10.1145\/640128.604148"},{"key":"1_CR19","unstructured":"Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley (1996)"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1017\/S0956796898003013","volume":"8","author":"R.G. Morgan","year":"1998","unstructured":"Morgan, R.G., Jarvis, S.A.: Profiling Large-Scale Lazy Functional Programs. Journal of Functional Programing\u00a08(3), 201\u2013237 (1998)","journal-title":"Journal of Functional Programing"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24622-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A Complete Method for the Synthesis of Linear Ranking Functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 239\u2013251. Springer, Heidelberg (2004)"},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1093\/logcom\/5.4.495","volume":"5","author":"D. Sands","year":"1995","unstructured":"Sands, D.: A Na\u00efve Time Analysis and its Theory of Cost Equivalence. Journal of Logic and Computation\u00a05(4), 495\u2013541 (1995)","journal-title":"Journal of Logic and Computation"},{"issue":"9","key":"1_CR23","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 of the ACM\u00a018(9), 528\u2013539 (1975)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","FM 2015: Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19249-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:27:41Z","timestamp":1676942861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19249-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319192482","9783319192499"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19249-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}