{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:21:45Z","timestamp":1725891705988},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_6","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T09:11:25Z","timestamp":1283850685000},"page":"84-99","source":"Crossref","is-referenced-by-count":1,"title":["Static Complexity Analysis of Higher Order Programs"],"prefix":"10.1007","author":[{"given":"James","family":"Avery","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Kristiansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Yves","family":"Moyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-69407-6_7","volume-title":"Logic and Theory of Algorithms","author":"A.M. Ben-Amram","year":"2008","unstructured":"Ben-Amram, A.M., Jones, N.D., Kristiansen, L.: Linear, polynomial or exponential? Complexity inference in polynomial time. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol.\u00a05028, pp. 67\u201376. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2003.10.022","volume":"318","author":"R. Benzinger","year":"2004","unstructured":"Benzinger, R.: Automated higher-order complexity analysis. Theor. Comput. Sci.\u00a0318(1-2), 79\u2013103 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations, a way to control resources. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2011.02.007"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1555746.1555750","volume":"10","author":"T. Crolard","year":"2009","unstructured":"Crolard, T., Polonowski, E., Valarcher, P.: Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Logic\u00a010(4), 1\u201337 (2009)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1555746.1555752","volume":"10","author":"N.D. Jones","year":"2009","unstructured":"Jones, N.D., Kristiansen, L.: A flow calculus of mwp-bounds for complqexity analysis. ACM Trans. Comput. Logic\u00a010(4), 1\u201341 (2009)","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11494645_33","volume-title":"New Computational Paradigms","author":"L. Kristiansen","year":"2005","unstructured":"Kristiansen, L., Jones, N.D.: The flow of data and the complexity of algorithms. In: Cooper, S.B., L\u00f6we, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol.\u00a03526, pp. 263\u2013274. Springer, Heidelberg (2005)"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1555746.1555751","volume":"10","author":"J.-Y. Marion","year":"2009","unstructured":"Marion, J.-Y., P\u00e9choux, R.: Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Logic\u00a010(4), 1\u201331 (2009)","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/800196.806014","volume-title":"ACM \u201967: Proceedings of the 1967 22nd National Conference","author":"A.R. Meyer","year":"1967","unstructured":"Meyer, A.R., Ritchie, D.M.: The complexity of loop programs. In: ACM \u201967: Proceedings of the 1967 22nd National Conference, pp. 465\u2013469. ACM, New York (1967)"},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S0097539704445597","volume":"35","author":"K.-H. Niggl","year":"2006","unstructured":"Niggl, K.-H., Wunderlich, H.: Certifying polynomial time and linear\/polynomial space for imperative programs. SIAM J. Comput.\u00a035(5), 1122\u20131147 (2006)","journal-title":"SIAM J. Comput."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T04:12:49Z","timestamp":1553055169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15331-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153303","9783642153310"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15331-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}