{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:49:08Z","timestamp":1775868548082,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540330950","type":"print"},{"value":"9783540330967","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11693024_3","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T13:30:35Z","timestamp":1143552635000},"page":"22-37","source":"Crossref","is-referenced-by-count":70,"title":["Type-Based Amortised Heap-Space Analysis"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hofmann","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Jost","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Berger, E.D., Zorn, B.G., McKinley, K.S.: Reconsidering custom memory allocation. In: Proceedings of the Conference on Object-Oriented Programming: Systems, Languages, and Applications, OOPSLA (2002)","DOI":"10.1145\/582419.582421"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/777388.777395","volume-title":"Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semanticsbased program manipulation (PEPM)","author":"M. Bozga","year":"2003","unstructured":"Bozga, M., Iosif, R., Laknech, Y.: Storeless semantics and alias logic. In: Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semanticsbased program manipulation (PEPM), pp. 55\u201365. ACM, New York (2003)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/11547662_7","volume-title":"Static Analysis","author":"W.-N. Chin","year":"2005","unstructured":"Chin, W.-N., Nguyen, H.H., Qin, S.C., Rinard, M.: Memory usage verification for OO programs. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 70\u201386. Springer, Heidelberg (2005)"},{"issue":"6","key":"3_CR4","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/773473.178263","volume":"29","author":"A. Deutsch","year":"1994","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: beyond k-limiting. ACM SIGPLAN Notices\u00a029(6), 230\u2013241 (1994)","journal-title":"ACM SIGPLAN Notices"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Flatt, M., Krishnamurthi, S., Felleisen, M.: Classes and mixins. In: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 171\u2013183 (1998)","DOI":"10.1145\/268946.268961"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-40018-9_14","volume-title":"Programming Languages and Systems","author":"A. Galland","year":"2003","unstructured":"Galland, A., Baudet, M.: Controlling and Optimizing the Usage of One Resource. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 195\u2013211. Springer, Heidelberg (2003)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/503032.503039","volume-title":"Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation","author":"G. G\u00f6mez","year":"2002","unstructured":"G\u00f6mez, G., Liu, Y.A.: Automatic time-bound analysis for a higher-order language. In: Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, pp. 75\u201386. ACM Press, New York (2002)"},{"key":"3_CR8","unstructured":"Grobauer, B.: Topics in Semantics-based Program Manipulation. PhD thesis, BRICS Aarhus (2001)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/604131.604148","volume-title":"Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 185\u2013197. ACM, New York (2003)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L.: Recursion and dynamic data structures in bounded space: towards embedded ML programming. In: Proc. International Conference on Functional Programming (ICFP), Paris, September 1999, pp. 70\u201381 (1999)","DOI":"10.1145\/317636.317785"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Pierce, B., Wadler, P.: Featherweight Java: A minimal core calculus for Java and GJ. In: Meissner, L. (ed.) Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages & Applications (OOPSLA), New York, vol.\u00a034(10), pp. 132\u2013146 (1999)","DOI":"10.1145\/320385.320395"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/360204.375719","volume-title":"Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","author":"S.S. Ishtiaq","year":"2001","unstructured":"Ishtiaq, S.S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 14\u201326. ACM, New York (2001)"},{"key":"3_CR13","unstructured":"Jonkers, H.: Abstract storage structures. In: de Bakker, J.W., van Vliet, J.C. (eds.) Algorithmic Languages, pp. 321\u2013343. IFIP, North Holland (1981)"},{"key":"3_CR14","unstructured":"Krone, J., Ogden, W.F., Sitaraman, M.: Modular verification of performance constraints. Technical report, Dep. of Comp. Sci., Clemson University (May 2003)"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/1040305.1040330","volume-title":"Proceedings of the 32nd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages (POPL)","author":"N. Rinetzky","year":"2005","unstructured":"Rinetzky, N., Bauer, J., Reps, T., Sagiv, M., Wilhelm, R.: A semantics for procedure local heaps and its abstractions. In: Proceedings of the 32nd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages (POPL), pp. 296\u2013309. ACM Press, New York (2005)"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0956796800000393","volume":"2","author":"J.-P. Talpin","year":"1992","unstructured":"Talpin, J.-P., Jouvelot, P.: Polymorphic type, region and effect inference. J. Funct. Program.\u00a02(3), 245\u2013271 (1992)","journal-title":"J. Funct. Program."},{"issue":"2","key":"3_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":"3_CR18","unstructured":"Tofte, M., Birkedal, L., Elsman, M., Hallenberg, N., Olesen, T., Sestoft, P.: Programming with regions in the ml kit. IT University of Copenhagen (April 2002), http:\/\/www.itu.dk\/research\/mlkit\/"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1996.2613","volume":"132","author":"M. Tofte","year":"1997","unstructured":"Tofte, M., Talpin, J.-P.: Region-based memory management. Information and Computation\u00a0132(2), 109\u2013176 (1997)","journal-title":"Information and Computation"},{"key":"3_CR20","volume-title":"Proceedings of The Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES)","author":"L. Unnikrishnan","year":"2001","unstructured":"Unnikrishnan, L., Stoller, S.D., Liu, Y.A.: Automatic accurate live memory analysis for garbage-collected languages. In: Proceedings of The Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), ACM, New York (2001)"},{"key":"3_CR21","unstructured":"Vasconcelos, P.: Space Cost Modeling for Concurrent Resource Sensitive Systems. PhD thesis, School of Comp. Sci., University of St Andrews, Scotland (to appear)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45332-6_7","volume-title":"Types in Compilation","author":"D.W. Walker","year":"2001","unstructured":"Walker, D.W., Morrisett, G.: Alias types for recursive data structures. In: Harper, R. (ed.) TIC 2000. LNCS, vol.\u00a02071, p. 177. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11693024_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T06:35:02Z","timestamp":1627194902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11693024_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330950","9783540330967"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11693024_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}