TY  - JOUR
A1  - Möller, Bernhard
T1  - Derivation of graph and pointer 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 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.
Y1  - 1993
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/18834
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-188340
SN  - 0302-9743
N1  - Formal program development: IFIP TC 2/WG 2 1 state of the art report
VL  - 755
SP  - 123
EP  - 160
PB  - Springer
ER  -