Towards pointer algebra

We show that the well-known unfold/fold transformation strategy is also fruitful for the (formal) derivation of correct pointer algorithms. The key to this extension is an algebra of partial maps which allows convenient description and manipulation of pointer structures at the functional level

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