| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [21 references]
https://hal.inria.fr/inria-00431469
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
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
File
csl.pdf
Files produced by the author(s)