TY  - JOUR
A1  - Möller, Bernhard
T1  - Algebraic calculation of graph and sorting algorithms
T2  - Lecture Notes in Computer Science
N2  - 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.
Y1  - 1993
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/19240
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-192400
N1  - Formal methods in programming and their applications: international conference, Academgorodok, Novosibirsk, Russia, June 28 - July 2, 1993; proceedings
VL  - 735
SP  - 394
EP  - 413
PB  - Springer
ER  -