{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:41:23Z","timestamp":1725842483894},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319265285"},{"type":"electronic","value":"9783319265292"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26529-2_21","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T07:23:39Z","timestamp":1449645819000},"page":"387-404","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Objects in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Hainry","sequence":"first","affiliation":[]},{"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.tcs.2011.07.009","volume":"413","author":"E Albert","year":"2012","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of object-oriented bytecode programs. Theoret. Comput. Sci. 413(1), 142\u2013159 (2012)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In: Logic in Computer Science, LICS, pp. 266\u2013275 (2004)","key":"21_CR2","DOI":"10.1109\/LICS.2004.1319621"},{"key":"21_CR3","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. Comput. Complex. 2, 97\u2013110 (1992)","journal-title":"Comput. Complex."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-27940-9_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"AM Ben-Amram","year":"2012","unstructured":"Ben-Amram, A.M., Genaim, S., Masud, A.N.: On the termination of integer loops. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 72\u201387. Springer, Heidelberg (2012)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11526841_8","volume-title":"FM 2005: Formal Methods","author":"D Cachera","year":"2005","unstructured":"Cachera, D., Jensen, T., Pichardie, D., Schneider, G.: Certified memory usage analysis. In: Fitzgerald, J.S., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol. 3582, pp. 91\u2013106. Springer, Heidelberg (2005)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/11817963_37","volume-title":"Computer Aided Verification","author":"B Cook","year":"2006","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Terminator: beyond safety. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 415\u2013418. Springer, Heidelberg (2006)"},{"unstructured":"Danner, N., Royer, J.S.: Ramified structural recursion and corecursion. In: CoRR abs\/1201.4567 (2012). \n                      http:\/\/arxiv.org\/abs\/1201.4567","key":"21_CR7"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-02658-4_7","volume-title":"Computer Aided Verification","author":"S Gulwani","year":"2009","unstructured":"Gulwani, S.: SPEED: symbolic complexity bound analysis. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 51\u201362. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: Speed: precise and efficient static estimation of program computational complexity. In: POPL 2009, pp. 127\u2013139. ACM (2009)","key":"21_CR9","DOI":"10.1145\/1594834.1480898"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-37075-5_20","volume-title":"Foundations of Software Science and Computation Structures","author":"E Hainry","year":"2013","unstructured":"Hainry, E., Marion, J.-Y., P\u00e9choux, R.: Type-based complexity analysis for fork processes. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol. 7794, pp. 305\u2013320. Springer, Heidelberg (2013)"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1805950.1805956","volume":"11","author":"M Hofmann","year":"2010","unstructured":"Hofmann, M., Sch\u00f6pp, U.: Pure pointer programs with iteration. ACM Trans. Comput. Log. 11(4), 26 (2010)","journal-title":"ACM Trans. Comput. Log."},{"doi-asserted-by":"crossref","unstructured":"Kersten, R., Shkaravska, O., van Gastel, B., Montenegro, M., van Eekelen, M.C.J.D.: Making resource analysis practical for real-time Java. In: JTRES, pp. 135\u2013144 (2012)","key":"21_CR12","DOI":"10.1145\/2388936.2388959"},{"issue":"1\/2","key":"21_CR13","first-page":"167","volume":"19","author":"D Leivant","year":"1993","unstructured":"Leivant, D., Marion, J.Y.: Lambda calculus characterizations of poly-time. Fundam. Inf. 19(1\/2), 167\u2013184 (1993)","journal-title":"Fundam. Inf."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-39212-2_32","volume-title":"Automata, Languages, and Programming","author":"D Leivant","year":"2013","unstructured":"Leivant, D., Marion, J.-Y.: Evolving graph-structures and their implicit computational complexity. In: Fomin, F.V., Freivalds, R.U., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 349\u2013360. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Marion, J.Y.: A type system for complexity flow analysis. In: Logic in Computer Science, LICS, pp. 123\u2013132 (2011)","key":"21_CR15","DOI":"10.1109\/LICS.2011.41"},{"issue":"2\/3","key":"21_CR16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","volume":"4","author":"D Volpano","year":"1996","unstructured":"Volpano, D., Irvine, C., Smith, G.: A sound type system for secure flow analysis. J. Comput. Secur. 4(2\/3), 167\u2013188 (1996)","journal-title":"J. Comput. Secur."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26529-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:00:49Z","timestamp":1559322049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26529-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319265285","9783319265292"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26529-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}