{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:48:56Z","timestamp":1775868536854,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642050886","type":"print"},{"value":"9783642050893","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05089-3_23","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T17:31:40Z","timestamp":1257269500000},"page":"354-369","source":"Crossref","is-referenced-by-count":35,"title":["\u201cCarbon Credits\u201d for Resource-Bounded Computations Using Amortised Analysis"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Jost","sequence":"first","affiliation":[]},{"given":"Hans-Wolfgang","family":"Loidl","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Hammond","sequence":"additional","affiliation":[]},{"given":"Norman","family":"Scaife","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Hofmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/1542431.1542450","volume-title":"Proc. ISMM 2009: Intl. Symp. on Memory Management","author":"E. Albert","year":"2009","unstructured":"Albert, E., Genaim, S., G\u00f3mez-Zamalloa, M.: Live Heap Space Analysis for Languages with Garbage Collection. In: Proc. ISMM 2009: Intl. Symp. on Memory Management, Dublin, Ireland, June 2009, pp. 129\u2013138. ACM, New York (2009)"},{"key":"23_CR2","unstructured":"Berkelaar, M., Eikland, K., Notebaert, P.: lp_solve: Open source (mixed-integer) linear programming system. GNU LGPL (Lesser General Public Licence), http:\/\/lpsolve.sourceforge.net\/5.5"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/1375634.1375655","volume-title":"Proc. ISMM 2008: Intl. Symp. on Memory Management","author":"V. Braberman","year":"2008","unstructured":"Braberman, V., Fern\u00e1ndez, F., Garbervetsky, D., Yovine, S.: Parametric Prediction of Heap Memory Requirements. In: Proc. ISMM 2008: Intl. Symp. on Memory Management, Tucson, USA, June 2008, pp. 141\u2013150. ACM, New York (2008)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/978-3-642-00590-9_14","volume-title":"ESOP 2009","author":"B. Campbell","year":"2009","unstructured":"Campbell, B.: Amortised Memory Analysis Using the Depth of Data Structures. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol.\u00a05502, pp. 190\u2013204. Springer, Heidelberg (2009)"},{"issue":"2,3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1012996816178","volume":"14","author":"W.-N. Chin","year":"2001","unstructured":"Chin, W.-N., Khoo, S.-C.: Calculating Sized Types. Higher-Order and Symbolic Computing\u00a014(2,3), 261\u2013300 (2001)","journal-title":"Higher-Order and Symbolic Computing"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/1375634.1375656","volume-title":"Proc. ISMM 2008: Intl. Symp. on Memory Management","author":"W.-N. Chin","year":"2008","unstructured":"Chin, W.-N., Nguyen, H., Popeea, C., Qin, S.: Analysing Memory Resource Bounds for Low-Level Programs. In: Proc. ISMM 2008: Intl. Symp. on Memory Management, Tucson, USA, June 2008, pp. 151\u2013160. ACM, New York (2008)"},{"key":"23_CR7","first-page":"184","volume-title":"Proc. POPL 2000: ACM Symp. on Principles of Prog. Langs.","author":"K. Crary","year":"2000","unstructured":"Crary, K., Weirich, S.: Resource Bound Certification. In: Proc. POPL 2000: ACM Symp. on Principles of Prog. Langs., Boston, USA, January 2000, pp. 184\u2013198. ACM, New York (2000)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0167-6423(99)00010-6","volume":"35","author":"C. Ferdinand","year":"1999","unstructured":"Ferdinand, C., Martin, F., Wilhelm, R., Alt, M.: Cache Behavior Prediction by Abstract Interpretation. Science of Comp. Prog.\u00a035(2), 163\u2013189 (1999)","journal-title":"Science of Comp. Prog."},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-540-39815-8_3","volume-title":"Generative Programming and Component Engineering","author":"K. Hammond","year":"2003","unstructured":"Hammond, K., Michaelson, G.: Hume: a Domain-Specific Language for Real-Time Embedded Systems. In: Pfenning, F., Smaragdakis, Y. (eds.) GPCE 2003. LNCS, vol.\u00a02830, pp. 37\u201356. Springer, Heidelberg (2003)"},{"issue":"4","key":"23_CR10","first-page":"258","volume":"7","author":"M. Hofmann","year":"2000","unstructured":"Hofmann, M.: A Type System for Bounded Space and Functional In-Place Update. Nordic Journal of Computing\u00a07(4), 258\u2013289 (Winter 2000)","journal-title":"Nordic Journal of Computing"},{"key":"23_CR11","first-page":"185","volume-title":"Proc. POPL\u00a02003: ACM Symp. on Principles of Prog. Langs.","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M., Jost, S.: Static Prediction of Heap Space Usage for First-Order Functional Programs. In: Proc. POPL\u00a02003: ACM Symp. on Principles of Prog. Langs., New Orleans, USA, January 2003, pp. 185\u2013197. ACM, New York (2003)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11693024_3","volume-title":"Programming Languages and Systems","author":"M. Hofmann","year":"2006","unstructured":"Hofmann, M., Jost, S.: Type-Based Amortised Heap-Space Analysis. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol.\u00a03924, pp. 22\u201337. Springer, Heidelberg (2006)"},{"key":"23_CR13","first-page":"410","volume-title":"Proc. POPL\u00a01996: ACM Symp. on Principles of Prog. Langs","author":"R. Hughes","year":"1996","unstructured":"Hughes, R., Pareto, L., Sabry, A.: Proving the Correctness of Reactive Systems Using Sized Types. In: Proc. POPL\u00a01996: ACM Symp. on Principles of Prog. Langs, St. Petersburg Beach, USA, January 1996, pp. 410\u2013423. ACM, New York (1996)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Kuo, S.M., Lee, B.H., Tian, W.: Real-Time Digital Signal Processing: Implementations and Applications, 2nd edn., April 2006. Wiley, Chichester (2006)","DOI":"10.1002\/0470035528"},{"key":"23_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530104","volume-title":"Purely Functional Data Structures","author":"C. Okasaki","year":"1998","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-73228-0_25","volume-title":"Typed Lambda Calculi and Applications","author":"O. Shkaravska","year":"2007","unstructured":"Shkaravska, O., van Kesteren, R., van Eekelen, M.: Polynomial Size Analysis of First-Order Functions. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 351\u2013365. Springer, Heidelberg (2007)"},{"issue":"2","key":"23_CR17","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":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-27861-0_6","volume-title":"Implementation of Functional Languages","author":"P. Vasconcelos","year":"2004","unstructured":"Vasconcelos, P., Hammond, K.: Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol.\u00a03145, pp. 86\u2013101. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","FM 2009: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05089-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:34Z","timestamp":1606168054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05089-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642050886","9783642050893"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05089-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}