{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:33:12Z","timestamp":1743132792121,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_22","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T12:27:59Z","timestamp":1267532879000},"page":"265-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Functional Scenario for Bytecode Verification of Resource Bounds"],"prefix":"10.1007","author":[{"given":"Roberto M.","family":"Amadio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solange","family":"Coupet-Grimal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvano","family":"Dal Zilio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Line","family":"Jakubiec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Stata, R.: A type system for Java bytecode subroutines. In: Proc. POPL (1998)","DOI":"10.1145\/268946.268959"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44904-3_3","volume-title":"Typed Lambda Calculi and Applications","author":"R. Amadio","year":"2003","unstructured":"Amadio, R.: Max-plus quasi-interpretations. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, Springer, Heidelberg (2003)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Amadio, R., Coupet-Grimal, S., Zilio, S.D., Jakubiec, L.: A functional scenario for bytecode verification of resource bounds. Research Report LIF 17-2004 (2004)","DOI":"10.1007\/978-3-540-30124-0_22"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01201998","volume":"2","author":"S. Bellantoni","year":"1992","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions. Computational Complexity\u00a02, 97\u2013110 (1992)","journal-title":"Computational Complexity"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45575-2_46","volume-title":"Perspectives of System Informatics","author":"G. Bonfante","year":"2001","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: On termination methods with space bound certifications. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, Springer, Heidelberg (2001)"},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term rewriting and all that","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)"},{"key":"22_CR7","volume-title":"Proc. Logic,Methodology, and Philosophy of Science II","author":"A. Cobham","year":"1965","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Proc. Logic,Methodology, and Philosophy of Science II. North Holland, Amsterdam (1965)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Hofmann, M.: The strength of non size-increasing computation. In: Proc. POPL (2002)","DOI":"10.1145\/503272.503297"},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and complexity, from a programming perspective","author":"N. Jones","year":"1997","unstructured":"Jones, N.: Computability and complexity, from a programming perspective. MIT Press, Cambridge (1997)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kildall, G.: A unified approach to global program optimization. In: Proc. POPL (1973)","DOI":"10.1145\/512927.512945"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Leivant, D.: Predicative recurrence and computational complexity i: word recurrence and poly-time. In: Clote, Remmel (eds.) Feasible mathematics II, Birkh\u00e4user (1994)","DOI":"10.1007\/978-1-4612-2566-9_11"},{"key":"22_CR12","volume-title":"The Java virtual machine specification","author":"T. Lindholm","year":"1999","unstructured":"Lindholm, T., Yellin, F.: The Java virtual machine specification. Addison-Wesley, Reading (1999)"},{"key":"22_CR13","unstructured":"Marion, J.-Y.: Complexit\u00e9 implicite des calculs, de la th\u00e9orie \u00e0 la pratique. Habilitation \u00e0 diriger des recherches, Universit\u00e9 de Nancy (2000)"},{"key":"22_CR14","unstructured":"Marion, J.-Y., Moyen, J.-Y.: Termination and resource analysis of assembly programs by Petri Nets. Technical Report, Universit\u00e9 de Nancy (2003)"},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/319301.319345","volume":"21","author":"G. Morriset","year":"1999","unstructured":"Morriset, G., Walker, D., Crary, K., Glew, N.: From system F to typed assembly language. ACM Transactions on Programming Languages and Systems\u00a021(3), 528\u2013569 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Necula, G.: Proof carrying code. In: Proc. POPL (1997)","DOI":"10.1145\/263699.263712"},{"key":"22_CR17","unstructured":"Sannella, D.: Mobile resource guarantee. In: IST-Global Computing research proposal, U. Edinburgh (2001), \n\nhttp:\/\/www.dcs.ed.ac.uk\/home\/mrg\/"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T20:03:33Z","timestamp":1579723413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}