{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:13:11Z","timestamp":1739337191820,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"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-04027-6_21","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:27:52Z","timestamp":1252949272000},"page":"271-286","source":"Crossref","is-referenced-by-count":4,"title":["Upper Bounds on Stream I\/O Using Semantic Interpretations"],"prefix":"10.1007","author":[{"given":"Marco","family":"Gaboardi","sequence":"first","affiliation":[]},{"given":"Romain","family":"P\u00e9choux","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Manna, Z., Ness, S.: On the termination of Markov algorithms. In: Third hawaii international conference on system science, pp. 789\u2013792 (1970)"},{"key":"21_CR2","unstructured":"Lankford, D.: On proving term rewriting systems are noetherien. tech. rep (1979)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of ACM POPL 1977, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations, a way to control resources. TCS (accepted)","DOI":"10.1016\/j.tcs.2011.02.007"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Amadio, R.: Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae 65(1-2) (2005)","DOI":"10.3233\/FUN-2005-65303"},{"key":"21_CR6","unstructured":"Bonfante, G., Marion, J.Y., Moyen, J.Y., P\u00e9choux, R.: Synthesis of quasi-interpretations. In: LCC 2005, LICS Workshop (2005), http:\/\/hal.inria.fr\/"},{"key":"21_CR7","unstructured":"Marion, J.Y., P\u00e9choux, R.: Sup-interpretations, a semantic method for static analysis of program resources. In: ACM TOCL 2009 (accepted, 2009), http:\/\/tocl.acm.org\/"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-79228-4_12","volume-title":"Theory and Applications of Models of Computation","author":"J.-Y. Marion","year":"2008","unstructured":"Marion, J.-Y., P\u00e9choux, R.: A Characterization of NCk by First Order Functional Programs. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 136\u2013147. Springer, Heidelberg (2008)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-87531-4_6","volume-title":"Computer Science Logic","author":"G. Bonfante","year":"2008","unstructured":"Bonfante, G., Kahle, R., Marion, J.-Y., Oitavem, I.: Recursion schemata for NC k . In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 49\u201363. Springer, Heidelberg (2008)"},{"key":"21_CR10","unstructured":"Dijkstra, E.W.: On the productivity of recursive definitions. EWD749 (1980)"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/69558.69563","volume":"11","author":"B. Sijtsma","year":"1989","unstructured":"Sijtsma, B.: On the productivity of recursive list definitions. ACM TOPLAS\u00a011(4), 633\u2013649 (1989)","journal-title":"ACM TOPLAS"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-58085-9_72","volume-title":"Types for Proofs and Programs","author":"T. Coquand","year":"1994","unstructured":"Coquand, T.: Infinite objects in type theory. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol.\u00a0806, pp. 62\u201378. Springer, Heidelberg (1994)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(81)90108-0","volume":"13","author":"W. Wadge","year":"1981","unstructured":"Wadge, W.: An extensional treatment of dataflow deadlock. TCS\u00a013, 3\u201315 (1981)","journal-title":"TCS"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-74240-1_24","volume-title":"Fundamentals of Computation Theory","author":"J. Endrullis","year":"2007","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.W.: Productivity of Stream Definitions. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 274\u2013287. Springer, Heidelberg (2007)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/BFb0000493","volume-title":"Algebraic Methodology and Software Technology","author":"A. Telford","year":"1997","unstructured":"Telford, A., Turner, D.: Ensuring streams flow. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol.\u00a01349, pp. 509\u2013523. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.apal.2005.05.006","volume":"136","author":"W. Buchholz","year":"2005","unstructured":"Buchholz, W.: A term calculus for (co-) recursive definitions on streamlike data structures. Annals of Pure and Applied Logic\u00a0136(1-2), 75\u201390 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: Proceedings of ACM POPL 1996, pp. 410\u2013423 (1996)","DOI":"10.1145\/237721.240882"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Frankau, S., Mycroft, A.: Stream processing hardware from functional language specifications. In: Proceeding of IEEE HICSS-36 (2003)","DOI":"10.1109\/HICSS.2003.1174809"},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: Proceedings of POPL 1993, pp. 144\u2013154 (1993)","DOI":"10.1145\/158511.158618"},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term-rewriting systems. TCS\u00a017(3), 279\u2013301 (1982)","journal-title":"TCS"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Marion, J.Y., P\u00e9choux, R.: Characterizations of polynomial complexity classes with a better intensionality. In: Proceedings ACM PPDP 2008, pp. 79\u201388 (2008)","DOI":"10.1145\/1389449.1389460"},{"key":"21_CR23","volume-title":"Introduction to Functional Programming","author":"R. Bird","year":"1988","unstructured":"Bird, R., Wadler, P.: Introduction to Functional Programming. Prentice-Hall, Englewood Cliffs (1988)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T04:12:07Z","timestamp":1739333527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}