Shorter paths to graph algorithms

  • Bernhard Möller
  • Martin Russling
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 669)


We illustrate the use of formal languages and relations in compact formal derivations of some graph algorithms.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. F.L. Bauer, R. Berghammer, M. Broy, W. Dosch, F. Geiselbrechtinger, R. Gnatz, E. Hangel, W. Hesse, B. Krieg-Brückner, A. Laut, T.A. Matzner, B. Möller, F. Nickl, H. Partsch, P. Pepper, K. Samelson, M. Wirsing, H. Wössner: The Munich project CIP. Volume I: The wide spectrum language CIP-L. Lecture Notes in Computer Science 183. Berlin: Springer 1985Google Scholar
  2. F.L. Bauer, B. Möller, H. Partsch, P. Pepper: Formal program construction by transformations — Computer-aided, Intuition-guided Programming. IEEE Transactions on Software Engineering 15, 165–180 (1989)CrossRefGoogle Scholar
  3. R. Berghammer: A transformational development of several algorithms for testing the existence of cycles in a directed graph. Institut für Informatik der TU München, TUM-I8615Google Scholar
  4. R. Bird: Lectures on constructive functional programming. In M. Broy (ed.): Constructive methods in computing science. NATO ASI Series. Series F: Computer and systems sciences 55. Berlin: Springer 1989, 151–216Google Scholar
  5. R.M. Burstall, J. Darlington: A transformation system for developing recursive programs. J. ACM 24, 44–67 (1977)CrossRefGoogle Scholar
  6. J. Cai, R. Paige: Program derivation by fixed point computation. Science of Computer Programming 11, 197–261 (1989)CrossRefGoogle Scholar
  7. C.J. Date: An introduction to database systems. Vol. I, 4th edition. Reading, Mass.: Addison-Wesley 1988Google Scholar
  8. M. Gondran, M. Minoux: Graphes et algorithmes. Paris: Eyrolles 1979Google Scholar
  9. P. Lescanne: Modèles non déterministes de types abstraits. R.A.I.R.O. Informatique théorique 16, 225–244 (1982)Google Scholar
  10. Z. Manna: Mathematical theory of computation. New York: McGraw-Hill 1974Google Scholar
  11. L.G.L.T. Meertens: Algorithmics — Towards programming as a mathematical activity. In J. W. de Bakker et al. (eds.): Proc CWI Symposium on Mathematics and Computer Science. CWI Monographs Vol 1. Amsterdam: North-Holland 1986, 289–334Google Scholar
  12. B. Möller: Applicative assertions. In: J.L.A. van de Snepscheut (ed.): Mathematics of Program Construction. Lecture Notes in Computer Science 375. Berlin: Springer 1989, 348–362Google Scholar
  13. B. Möller: Relations as a program development language. In B. Möller (ed.): Constructing programs from specifications. Proc. IFIP TC2/WG 2.1 Working Conference on Constructing Programs from Specifications, Pacific Grove, CA, USA, 13–16 May 1991. Amsterdam: North-Holland 1991, 373–397Google Scholar
  14. H.A. Partsch: Specification and transformation of programs — A formal approach to software development. Berlin: Springer 1990Google Scholar
  15. G. Schmidt, T. Ströhlein: Relationen und Graphen. Berlin: Springer 1989. English version: Relations and graphs (forthcoming)Google Scholar
  16. A. Tarski: On the calculus of relations. J. Symbolic Logic 6, 73–89 (1941)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Bernhard Möller
    • 1
  • Martin Russling
    • 1
  1. 1.Institut für MathematikUniversität AugsburgAugsburgGermany

Personalised recommendations