1. Arbib MH, Alagić S: Proof rules for gotos. Acta Informat. 11 (1979) 139–148.
2. Bakker JW de, Meertens LGLT: On the completeness of the inductive assertion method. J. Comput. Syst. Sci. 11 (1975) 323–357.
3. Berghammer R, Kempf P, Schmidt G, Ströhlein T: Relation Algebra and Logic of Programs. - In: Andréka H, Monk JD, Németi I (eds.): Algebraic Logic. Proc. of a Coll., Budapest, August 8–14, 1988, (Colloq. Math. Soc. J. Bolyai 54) North-Holland Publ. Co., Amsterdam, 1991, 37–58.
4. Berghammer R, Schmidt G: A relational view on gotos and dynamic logic. In: Schneider HJ, Göttler H (eds.): Proc. 8th Conf. on Graphtheoretic Concepts in Computer Science (WG 82), Neunkirchen a. Br. (Germany), June 16–18, 1982, Hanser, München, 1982, 13–24.
5. Berghammer R, Zierer H: Relational algebraic semantics of deterministic and nondeterministic programs. Theoret. Comput. Sci. 43 (1986) 123–147.