Inductive assertion patterns for recursive procedures

  • M. M. Fokkinga
Schemas De Programmes Schematology
Part of the Lecture Notes in Computer Science book series (LNCS, volume 19)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    de Bakker, J.W., Recursive procedures Math. Centre Tracts 24, Math. Centre Amsterdam, 1971.Google Scholar
  2. [2]
    de Bakker, J.W., and Meertens, L.G.L.T., Simple recursive program schemes and inductive assertions Math. Centre Report M142, Math. Centre Amsterdam, 1972Google Scholar
  3. [3]
    de Bakker, J.W., and de Roever, W.P., A calculus for recursive program schemes Proc. IRIA Symp. on Automata, Form.lang., Programming North Holland, Amsterdam (ed. Nivat)Google Scholar
  4. [4]
    Hoare, C.A.R., An axiomatic basis for computer programming C.ACM 12 pp. 576–583 (1969)Google Scholar
  5. [5]
    Fokkinga, M.M., Inductive Assertion Patterns for Recursive Procedures Techn. University Delft Report, 1973 (25 pp's)Google Scholar

Recently there has appeared

  1. [6]
    de Bakker, J.W. and Meertens, L.G.L.T., On the completeness of the inductive assertion method Math. Centre Report IW 12, Math. Centre Amsterdam, 1973. which is a generalisation of [2] and includes our results, however proved in a different way.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • M. M. Fokkinga
    • 1
  1. 1.Dept. of Math.Delft University of TechnologyDelftNetherlands

Personalised recommendations