{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:50:00Z","timestamp":1725745800855},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406140"},{"type":"electronic","value":"9783642406157"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40615-7_4","type":"book-chapter","created":{"date-parts":[[2013,8,21]],"date-time":"2013-08-21T21:08:02Z","timestamp":1377119282000},"page":"119-144","source":"Crossref","is-referenced-by-count":2,"title":["Automatic Inference of Bounds on Resource Consumption"],"prefix":"10.1007","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[]},{"given":"Diego Esteban","family":"Alonso-Blas","sequence":"additional","affiliation":[]},{"given":"Puri","family":"Arenas","sequence":"additional","affiliation":[]},{"given":"Jes\u00fas","family":"Correas","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Flores-Montoya","sequence":"additional","affiliation":[]},{"given":"Samir","family":"Genaim","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"G\u00f3mez-Zamalloa","sequence":"additional","affiliation":[]},{"given":"Abu Naser","family":"Masud","sequence":"additional","affiliation":[]},{"given":"German","family":"Puebla","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Miguel","family":"Rojas","sequence":"additional","affiliation":[]},{"given":"Guillermo","family":"Rom\u00e1n-D\u00edez","sequence":"additional","affiliation":[]},{"given":"Damiano","family":"Zanardini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-09526-8_16","volume-title":"Mathematical Foundations of Computer Science 1979","author":"A. Adachi","year":"1979","unstructured":"Adachi, A., Kasai, T., Moriya, E.: A Theoretical Study of the Time Analysis of Programs. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 201\u2013207. Springer, Heidelberg (1979)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-10672-9_21","volume-title":"Programming Languages and Systems","author":"E. Albert","year":"2009","unstructured":"Albert, E., Arenas, P., Alonso, D., Genaim, S., Puebla, G.: Asymptotic Resource Usage Bounds. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol.\u00a05904, pp. 294\u2013310. Springer, Heidelberg (2009)"},{"key":"4_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":"4_CR4","doi-asserted-by":"crossref","unstructured":"Albert, E., Arenas, P., Genaim, S., G\u00f3mez-Zamalloa, M., Puebla, G.: COSTABS: A Cost and Termination Analyzer for ABS. In: Procs. of PEPM 2012, pp. 151\u2013154. ACM Press (2012)","DOI":"10.1145\/2103746.2103774"},{"key":"4_CR5","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":"4_CR6","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":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-15769-1_7","volume-title":"Static Analysis","author":"E. Albert","year":"2010","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Ram\u00edrez Deantes, D.V.: 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)"},{"issue":"1","key":"4_CR8","first-page":"142","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 (Special Issue on Quantitative Aspects of Programming Languages)\u00a0413(1), 142\u2013159 (2012)","journal-title":"Theoretical Computer Science (Special Issue on Quantitative Aspects of Programming Languages)"},{"key":"4_CR9","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":"4_CR10","doi-asserted-by":"crossref","unstructured":"Albert, E., Correas, J., Puebla, G., Rom\u00e1n-D\u00edez, G.: Incremental Resource Usage Analysis. In: Procs. of PEPM 2012, pp. 25\u201334. ACM Press (2012)","DOI":"10.1145\/2103746.2103754"},{"key":"4_CR11","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":"4_CR12","doi-asserted-by":"crossref","unstructured":"Albert, E., Flores-Montoya, A., Genaim, S.: Maypar: A May-Happen-in-Parallel Analyzer for Concurrent Objects. In: Proc. of FSE-20, SIGSOFT\/FSE 2012, pp. 1\u20134. ACM (2012)","DOI":"10.1145\/2393596.2393611"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M.: Heap Space Analysis for Garbage Collected Languages. Science of Computer Programming (2012) (to appear)","DOI":"10.1016\/j.scico.2012.10.008"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-18275-4_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E. Albert","year":"2011","unstructured":"Albert, E., Genaim, S., Masud, A.N.: More Precise yet Widely Applicable Cost Analysis. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 38\u201353. Springer, Heidelberg (2011)"},{"key":"4_CR15","unstructured":"Albert, E., Genaim, S., Rom\u00e1n-D\u00edez, G.: Conditional Termination of Loops over Arrays. In: Proc. of Bytecode 2012 (2012)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-33125-1_27","volume-title":"Static Analysis","author":"D.E. Alonso-Blas","year":"2012","unstructured":"Alonso-Blas, D.E., Genaim, S.: On the Limits of the Classical Approach to Cost Analysis. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol.\u00a07460, pp. 405\u2013421. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R. Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems. Science of Computer Programming\u00a072(1-2), 3\u201321 (2008)","journal-title":"Science of Computer Programming"},{"issue":"1-2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2003.10.022","volume":"318","author":"R. Benzinger","year":"2004","unstructured":"Benzinger, R.: Automated Higher-Order Complexity Analysis. Theoretical Computer Science\u00a0318(1-2), 79\u2013103 (2004)","journal-title":"Theoretical Computer Science"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. ACM Transactions on Programming Languages and Systems\u00a029(2) (2007)","DOI":"10.1145\/1216374.1216378"},{"key":"4_CR20","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. of POPL 1977, pp. 238\u2013252. ACM Press (1977)","DOI":"10.1145\/512950.512973"},{"issue":"5","key":"4_CR21","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"},{"issue":"3","key":"4_CR22","first-page":"243","volume":"22","author":"P. Feautrier","year":"1988","unstructured":"Feautrier, P.: Parametric Integer Programming. RAIRO Recherche Op\u00e9rationnelle\u00a022(3), 243\u2013268 (1988)","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"key":"4_CR23","unstructured":"Genaim, S., Zanardini, D.: The Acyclicity Inference of COSTA. In: 11th International Workshop on Termination (2010)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-21461-5_11","volume-title":"Formal Techniques for Distributed Systems","author":"E. Giachino","year":"2011","unstructured":"Giachino, E., Laneve, C.: Analysis of Deadlocks in Object Groups. In: Bruni, R., Dingel, J. (eds.) FORTE 2011 and FMOODS 2011. LNCS, vol.\u00a06722, pp. 168\u2013182. Springer, Heidelberg (2011)"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/349214.349216","volume":"22","author":"M. Hermenegildo","year":"2000","unstructured":"Hermenegildo, M., Puebla, G., Marriott, K., Stuckey, P.: Incremental Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems\u00a022(2), 187\u2013223 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1-2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S1471068411000457","volume":"12","author":"M.V. Hermenegildo","year":"2012","unstructured":"Hermenegildo, M.V., Bueno, F., Carro, M., L\u00f3pez, P., Mera, E., Morales, J.F., Puebla, G.: An Overview of Ciao and its Design Philosophy. Theory and Practice of Logic Programming\u00a012(1-2), 219\u2013252 (2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1102.5497","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmannn, M.: Multivariate Amortized Resource Analysis. ACM Transactions on Programming Languages and Systems\u00a034(3), 14:1\u201314:62 (2012)","DOI":"10.1145\/2362389.2362393"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-25271-6_8","volume-title":"Formal Methods for Components and Objects","author":"E.B. Johnsen","year":"2011","unstructured":"Johnsen, E.B., H\u00e4hnle, R., Sch\u00e4fer, J., Schlatte, R., Steffen, M.: ABS: A Core Language for Abstract Behavioral Specification. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol.\u00a06957, pp. 142\u2013164. Springer, Heidelberg (2011)"},{"key":"4_CR29","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall (1993)"},{"key":"4_CR30","unstructured":"Jost, S.: Automated Amortised Analysis. PhD thesis, Ludwig-Maximilians-Universit\u00e4t (August. 2010)"},{"issue":"2","key":"4_CR31","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/42190.42347","volume":"10","author":"D. Metayer Le","year":"1988","unstructured":"Le Metayer, D.: ACE: An Automatic Complexity Evaluator. ACM Transactions on Programming Languages and Systems\u00a010(2), 248\u2013266 (1988)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR32","unstructured":"Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley (1996)"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-74610-2_24","volume-title":"Logic Programming","author":"J. Navas","year":"2007","unstructured":"Navas, J., Mera, E., L\u00f3pez-Garc\u00eda, P., Hermenegildo, M.V.: User-Definable Resource Bounds Analysis for Logic Programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 348\u2013363. Springer, Heidelberg (2007)"},{"key":"4_CR34","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)"},{"key":"4_CR35","unstructured":"Rodriguez, D.: Amortised Resource Analysis for Object-Oriented Programs. Phd thesis, LMU Munich (October 2012)"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Rosendahl, M.: Automatic Complexity Analysis. In: Proc. of FPCA 1989, pp. 144\u2013156. ACM Press (1989)","DOI":"10.1145\/99370.99381"},{"issue":"4","key":"4_CR37","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"},{"key":"4_CR38","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":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-70592-5_6","volume-title":"ECOOP 2008 \u2013 Object-Oriented Programming","author":"S. Srinivasan","year":"2008","unstructured":"Srinivasan, S., Mycroft, A.: Kilim: Isolation-Typed Actors for Java. In: Vitek, J. (ed.) ECOOP 2008. LNCS, vol.\u00a05142, pp. 104\u2013128. Springer, Heidelberg (2008)"},{"issue":"2","key":"4_CR40","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Amortized Computational Complexity. SIAM Journal on Algebraic and Discrete Methods\u00a06(2), 306\u2013318 (1985)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Strictness Analysis Aids Time Analysis. In: ACM Symposium on Principles of Programming Languages (POPL 1988). ACM Press (1988)","DOI":"10.1145\/73560.73571"},{"issue":"9","key":"4_CR42","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"},{"issue":"1-2","key":"4_CR43","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J. Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory and Practice of Logic Programming\u00a012(1-2), 67\u201396 (2012)","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Genaim, S., Zanardini, D.: Reachability-based Acyclicity Analysis by Abstract Interpretation. Theoretical Computer Science (2013)","DOI":"10.1016\/j.tcs.2012.12.018"},{"issue":"2","key":"4_CR45","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":"4_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-92188-2_5","volume-title":"Formal Methods for Components and Objects","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: COSTA: Design and implementation of a cost and termination analyzer for java bytecode. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol.\u00a05382, pp. 113\u2013132. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40615-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:44:38Z","timestamp":1558021478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40615-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406140","9783642406157"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40615-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}