{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:51Z","timestamp":1763467911562,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005893"},{"type":"electronic","value":"9783642005909"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00590-9_14","type":"book-chapter","created":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T12:05:58Z","timestamp":1238155558000},"page":"190-204","source":"Crossref","is-referenced-by-count":25,"title":["Amortised Memory Analysis Using the Depth of Data Structures"],"prefix":"10.1007","author":[{"given":"Brian","family":"Campbell","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"POPL 2003: Proceedings of the 30th ACM Symposium on Principles of Programming Languages","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: POPL 2003: Proceedings of the 30th ACM Symposium on Principles of Programming Languages, New Orleans. ACM Press, New York (2003)"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1017\/S0956796802004495","volume":"13","author":"P. O\u2019Hearn","year":"2003","unstructured":"O\u2019Hearn, P.: On bunched typing. Journal of Functional Programming\u00a013(4), 747\u2013796 (2003)","journal-title":"Journal of Functional Programming"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30569-9_1","volume-title":"Construction and Analysis of Safe, Secure, and Interoperable Smart Devices","author":"D. Aspinall","year":"2005","unstructured":"Aspinall, D., Gilmore, S., Hofmann, M., Sannella, D., Stark, I.: Mobile resource guarantees for smart devices. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol.\u00a03362, pp. 1\u201326. Springer, Heidelberg (2005)"},{"key":"14_CR4","unstructured":"Jost, S., Loidl, H.W., Hammond, K.: Report on stack-space analysis (revised). Deliverable D05, The Embounded Project (IST-510255) (2007)"},{"key":"14_CR5","unstructured":"Campbell, B.: Prediction of linear memory usage for first-order functional programs. In: Trends in Functional Programming, vol.\u00a09 (2008) (to appear)"},{"issue":"2","key":"14_CR6","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":"14_CR7","unstructured":"Campbell, B.: Type-based amortized stack memory prediction. PhD thesis, University of Edinburgh (2008)"},{"key":"14_CR8","unstructured":"Jost, S., Loidl, H.W., Hammond, K.: Report on heap-space analysis. Deliverable D11, The Embounded Project (IST-510255 ) (2007)"},{"key":"14_CR9","unstructured":"Jost, S.: Amortised Analysis for Functional Programs. PhD thesis, Ludwig-Maximilians-University (forthcoming, provisional title) (2008)"},{"key":"14_CR10","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 (for an object-oriented language). In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol.\u00a03924, pp. 22\u201337. Springer, Heidelberg (2006)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/182409.182439","volume-title":"LFP 1994: Proceedings of the 1994 ACM conference on LISP and functional programming","author":"B. Reistad","year":"1994","unstructured":"Reistad, B., Gifford, D.K.: Static dependent costs for estimating execution time. In: LFP 1994: Proceedings of the 1994 ACM conference on LISP and functional programming, pp. 65\u201378. ACM Press, New York (1994)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/317636.317785","volume-title":"ICFP 1999: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming","author":"J. Hughes","year":"1999","unstructured":"Hughes, J., Pareto, L.: Recursion and dynamic data-structures in bounded space: towards embedded ML programming. In: ICFP 1999: Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming, pp. 70\u201381. ACM Press, New York (1999)"},{"issue":"2-3","key":"14_CR13","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 Computation\u00a014(2-3), 261\u2013300 (2001)","journal-title":"Higher Order and Symbolic Computation"},{"key":"14_CR14","first-page":"75","volume-title":"PEPM 2003: Proceedings of the 2003 ACM SIGPLAN workshop on Partial Evaluation and Semantics-based Program Manipulation","author":"W.N. Chin","year":"2003","unstructured":"Chin, W.N., Khoo, S.C., Xu, D.N.: Extending sized type with collection analysis. In: PEPM 2003: Proceedings of the 2003 ACM SIGPLAN workshop on Partial Evaluation and Semantics-based Program Manipulation, pp. 75\u201384. ACM Press, New York (2003)"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1145\/1062455.1062500","volume-title":"ICSE 2005: Proceedings of the 27th International Conference on Software Engineering","author":"W.N. Chin","year":"2005","unstructured":"Chin, W.N., Khoo, S.C., Qin, S., Popeea, C., Nguyen, H.H.: Verifying safety policies with size properties and alias controls. In: ICSE 2005: Proceedings of the 27th International Conference on Software Engineering, pp. 186\u2013195. ACM Press, New York (2005)"},{"key":"14_CR16","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., 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)"},{"key":"14_CR17","first-page":"151","volume-title":"ISMM 2008: Proceedings of the 7th international symposium on Memory management","author":"W.N. Chin","year":"2008","unstructured":"Chin, W.N., Nguyen, H.H., Popeea, C., Qin, S.: Analysing memory resource bounds for low-level programs. In: ISMM 2008: Proceedings of the 7th international symposium on Memory management, pp. 151\u2013160. ACM, New York (2008)"},{"key":"14_CR18","unstructured":"Vasconcelos, P.: Space Cost Analysis Using Sized Types. PhD thesis, University of St Andrews (2008)"},{"issue":"5","key":"14_CR19","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":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-27861-0_6","volume-title":"Implementation of Functional Languages","author":"P.B. Vasconcelos","year":"2004","unstructured":"Vasconcelos, P.B., 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)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-69166-2_15","volume-title":"Static Analysis","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Automatic inference of upper bounds for recurrence relations in cost analysis. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol.\u00a05079, pp. 221\u2013237. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00590-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T18:42:26Z","timestamp":1739040146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00590-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005893","9783642005909"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00590-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}