Ideal streams
- We introduce operators and laws of an algebra of formal languages, a subalgebra of which corresponds to the algebra of (multiary) relations. This algebra is then used to give a simplified semantics for finite and infinite streams, based on the ideal completion. We show how some essential operations on streams and notions concerning correctness are expressed and show the use of the underlying algebra in reasoning about streams. Moreover, we give a simple treatment of non-determinacy. The approach is illustrated with a formal description and correctness proof for the alternating bit protocol. This study is part of an attempt to single out a framework for program development at a very high level of discourse, close to informal reasoning but still with full formal precision.
Author: | Bernhard MöllerGND |
---|---|
Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/20642 |
ISBN: | 0-444-82020-5OPAC |
Parent Title (English): | Programming concepts, methods and calculi: proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi (PROCOMET '94), San Miniato, Italy, 6 - 10 June, 1994 |
Publisher: | Elsevier |
Place of publication: | Amsterdam [u.a.] |
Editor: | Ernst-Rüdiger Olderog |
Type: | Part of a Book |
Language: | English |
Year of first Publication: | 1994 |
Release Date: | 2017/07/21 |
First Page: | 39 |
Last Page: | 58 |
Series: | IFIP transactions : A, Computer science and technology; 56 |
Institutes: | Fakultät für Angewandte Informatik |
Fakultät für Angewandte Informatik / Institut für Informatik | |
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme |