HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Upper Bounds on Stream I/O Using Semantic Interpretations

Abstract : This paper extends for the first time semantics interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams. By I/O upper bounds, we mean temporal relations between the number of reads performed on the input stream elements and the number of output elements produced. We study several I/O upper bounds properties that are of both theoretical and practical interests in order to avoid memory overflows.
Document type :
Conference papers
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

Contributor : Romain Péchoux Connect in order to contact the contributor
Submitted on : Friday, November 20, 2009 - 10:49:51 AM
Last modification on : Tuesday, February 8, 2022 - 3:08:03 AM
Long-term archiving on: : Thursday, June 17, 2010 - 8:10:10 PM


Files produced by the author(s)




Marco Gaboardi, Romain Péchoux. Upper Bounds on Stream I/O Using Semantic Interpretations. 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL, Sep 2009, Coimbra, Portugal. pp.271-286, ⟨10.1007/978-3-642-04027-6_21⟩. ⟨inria-00431469⟩



Record views


Files downloads