Derivation of graph and pointer algorithms

  • 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 in the formal specification and derivation of some graph and pointer algorithms. 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.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Bernhard MöllerGND
URN:urn:nbn:de:bvb:384-opus4-188340
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/18834
ISSN:0302-9743OPAC
Parent Title (English):Lecture Notes in Computer Science
Publisher:Springer
Type:Article
Language:English
Year of first Publication:1993
Publishing Institution:Universität Augsburg
Release Date:2017/07/21
Volume:755
First Page:123
Last Page:160
Note:
Formal program development: IFIP TC 2/WG 2 1 state of the art report
DOI:https://doi.org/10.1007/3-540-57499-9_19
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
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):Deutsches Urheberrecht