Algebraic calculation of graph and sorting 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 sorting 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
Postprint
Statistics
Additional Services
| Author: | Bernhard MöllerGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-192400 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/19240 |
| 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: | 735 |
| First Page: | 394 |
| Last Page: | 413 |
| Note: | Formal methods in programming and their applications: international conference, Academgorodok, Novosibirsk, Russia, June 28 - July 2, 1993; proceedings |
| DOI: | https://doi.org/10.1007/BFb0039722 |
| 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 |
