Data-Oblivious Stream Productivity
We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidable, but for restricted formats computable sufficient conditions can be obtained. The usual analysis, also adopted here, disregards the identity of data, thus leading to approaches that we call data-oblivious. We present a method that is provably optimal among all such data-oblivious approaches. This means that in order to improve on our algorithm one has to proceed in a data-aware fashion.
Unable to display preview. Download preview PDF.
- 2.Endrullis, J., Grabmayer, C., Hendriks, D.: Data-Oblivious Stream Productivity. Technical report (2008), http://arxiv.org/pdf/0806.2680
- 4.Hughes, J., Pareto, L., Sabry, A.: Proving the Correctness of Reactive Systems Using Sized Types. In: POPL 1996, pp. 410–423 (1996)Google Scholar
- 7.Telford, A., Turner, D.: Ensuring Streams Flow. In: AMAST, pp. 509–523 (1997)Google Scholar
- 8.Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)Google Scholar