{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:21:33Z","timestamp":1725891693649},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153303"},{"type":"electronic","value":"9783642153310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15331-0_2","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T09:11:25Z","timestamp":1283850685000},"page":"18-33","source":"Crossref","is-referenced-by-count":0,"title":["Improvements to a Resource Analysis for Hume"],"prefix":"10.1007","author":[{"given":"Hans-Wolfgang","family":"Loidl","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Jost","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","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)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-92188-2_2","volume-title":"Formal Methods for Components and Objects","author":"L. Beringer","year":"2008","unstructured":"Beringer, L., Hofmann, M., Pavlova, M.: Certification Using the Mobius Base Logic. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol.\u00a05382, pp. 25\u201351. Springer, Heidelberg (2008)"},{"key":"2_CR3","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":"2_CR4","first-page":"141","volume-title":"Intl. Symp. on Memory Management (ISMM\u201908)","author":"V. Braberman","year":"2008","unstructured":"Braberman, V., Fern\u00e1ndez, F., Garbervetsky, D., Yovine, S.: Parametric Prediction of Heap Memory Requirements. In: Intl. Symp. on Memory Management (ISMM\u201908), Tucson, USA, pp. 141\u2013150. ACM, New York (June 2008)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-00590-9_14","volume-title":"Programming Languages and Systems","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":"2_CR6","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":"2_CR7","first-page":"151","volume-title":"Intl. Symp. on Memory Management (ISMM\u201908)","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: Intl. Symp. on Memory Management (ISMM\u201908), Tucson, USA, June, pp. 151\u2013160. ACM, New York (2008)"},{"key":"2_CR8","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)"},{"key":"2_CR9","first-page":"184","volume-title":"Symp. on Principles of Programming Languages (POPL\u201900)","author":"K. Crary","year":"2000","unstructured":"Crary, K., Weirich, S.: Resource Bound Certification. In: Symp. on Principles of Programming Languages (POPL\u201900), Boston, USA, pp. 184\u2013198. ACM, New York (2000)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-45449-7_32","volume-title":"Embedded Software","author":"C. Ferdinand","year":"2001","unstructured":"Ferdinand, C., Heckmann, R., Langenbach, M., Martin, F., Schmidt, M., Theiling, H., Thesing, S., Wilhelm, R.: Reliable and Precise WCET Determination for a Real-Life Processor. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol.\u00a02211, pp. 469\u2013485. Springer, Heidelberg (2001)"},{"key":"2_CR11","unstructured":"The Glasgow Haskell Compiler, http:\/\/haskell.org\/ghc"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BFb0057778","volume-title":"Languages, Compilers, and Tools for Embedded Systems","author":"G. Gomez","year":"1998","unstructured":"Gomez, G., Liu, Y.A.: Automatic Accurate Time-Bound Analysis for High-Level Languages. In: M\u00fcller, F., Bestavros, A. (eds.) LCTES 1998. LNCS, vol.\u00a01474, pp. 31\u201340. Springer, Heidelberg (1998)"},{"key":"2_CR13","first-page":"127","volume-title":"Symp. on Principles of Prog. Langs. (POPL\u201909)","author":"S. Gulwani","year":"2009","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: SPEED: Precise and Efficient Static Estimation of Program Computational Complexity. In: Symp. on Principles of Prog. Langs (POPL\u201909), Savannah, USA, pp. 127\u2013139. ACM, New York (January 2009)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/11894100_4","volume-title":"Central European Functional Programming School","author":"K. Hammond","year":"2006","unstructured":"Hammond, K.: Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach. In: Horv\u00e1th, Z. (ed.) CEFP 2005. LNCS, vol.\u00a04164, pp. 100\u2013134. Springer, Heidelberg (2006)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.J.: 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)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-642-11957-6_16","volume-title":"ESOP 2010","author":"J. Hoffmann","year":"2010","unstructured":"Hoffmann, J., Hofmann, M.: Amortized Resource Analysis with Polynomial Potential \u2014 A Static Inference of Polynomial Bounds for Functional Programs. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 287\u2013306. Springer, Heidelberg (2010)"},{"key":"2_CR17","first-page":"185","volume-title":"Symp. on Principles of Programming Languages (POPL\u00a0\u201903)","author":"M. Hofmann","year":"2003","unstructured":"Hofmann, M., Jost, S.: Static Prediction of Heap Space Usage for First-Order Functional Programs. In: Symp. on Principles of Programming Languages (POPL\u00a0\u201903), New Orleans, USA, pp. 185\u2013197. ACM, New York (January 2003)"},{"key":"2_CR18","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":"2_CR19","first-page":"70","volume-title":"Intl. Conf. on Functional Programming (ICFP\u00a0\u201999)","author":"R.J.M. Hughes","year":"1999","unstructured":"Hughes, R.J.M., Pareto, L.: Recursion and Dynamic Data Structures in Bounded Space: Towards Embedded ML Programming. In: Intl. Conf. on Functional Programming (ICFP\u00a0\u201999), Paris, France, pp. 70\u201381. ACM, New York (September 1999)"},{"key":"2_CR20","first-page":"410","volume-title":"Symp. on Principles of Programming Languages (POPL\u201996)","author":"R.J.M. Hughes","year":"1996","unstructured":"Hughes, R.J.M., Pareto, L., Sabry, A.: Proving the Correctness of Reactive Systems Using Sized Types. In: Symp. on Principles of Programming Languages (POPL\u201996), St. Petersburg Beach, USA, pp. 410\u2013423. ACM Press, New York (January 1996)"},{"key":"2_CR21","first-page":"223","volume-title":"Symp. on Principles of Prog. Langs. (POPL\u00a0\u201910)","author":"S. Jost","year":"2010","unstructured":"Jost, S., Loidl, H.-W., Hammond, K., Hofmann, M.: Static Determination of Quantitative Resource Usage for Higher-Order Programs. In: Symp. on Principles of Prog. Langs (POPL\u00a0\u201910), Madrid, Spain, pp. 223\u2013236. ACM, New York (January 2010)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-05089-3_23","volume-title":"FM 2009: Formal Methods","author":"S. Jost","year":"2009","unstructured":"Jost, S., Loidl, H.-W., Hammond, K., Scaife, N., Hofmann, M.: \u201cCarbon Credits\u201d for Resource-Bounded Computations Using Amortised Analysis. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 354\u2013369. Springer, Heidelberg (2009)"},{"key":"2_CR23","first-page":"13","volume-title":"Euromicro Conf. on Real-Time Systems (ECRTS\u201909)","author":"S. Jost","year":"2009","unstructured":"Jost, S., Loidl, H.-W., Scaife, N., Hammond, K., Michaelson, G., Hofmann, M.: Worst-Case Execution Time Analysis through Types. In: Euromicro Conf. on Real-Time Systems (ECRTS\u201909), Dublin, Ireland, pp. 13\u201316. ACM, New York (July 1-3, 2009)"},{"key":"2_CR24","doi-asserted-by":"publisher","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":"2_CR25","doi-asserted-by":"crossref","unstructured":"Pena, R., Segura, C., Montenegro, M.: A Sharing Analysis for Safe. In: Symp. on Trends in Functional Prog. (TFP\u201906), Nottingham, pp. 109\u2013128. Intellect (2006)","DOI":"10.2307\/j.ctv36xvknz.10"},{"key":"2_CR26","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":"2_CR27","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":"2_CR28","unstructured":"Vasconcelos, P.B.: Cost Inference and Analysis for Recursive Functional Programs. PhD thesis, University of St Andrews (February 2008)"},{"key":"2_CR29","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)"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1347375.1347389","volume":"7","author":"R. Wilhelm","year":"2008","unstructured":"Wilhelm, R., et al.: The Worst-Case Execution-Time Problem\u2014Overview of Methods and Survey of Tools. ACM Trans. Embed. Comput. Syst.\u00a07(3), 1\u201353 (2008)","journal-title":"ACM Trans. Embed. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Foundational and Practical Aspects of Resource Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15331-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T06:06:01Z","timestamp":1685772361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15331-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153303","9783642153310"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15331-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}