Upper Bounds on Stream I-O Using Semantic InterpretationsReport as inadecuate

Upper Bounds on Stream I-O Using Semantic Interpretations - Download this document for free, or read online. Document in PDF available to download.

1 Dipartimento di Informatica Torino 2 CARTE - Theoretical adverse computations, and safety Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods 3 cs.tcd - Computer Science Department Trinity College Dublin

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.

Author: Marco Gaboardi - Romain Péchoux -

Source: https://hal.archives-ouvertes.fr/


Related documents