DIJKSTRA's predicate transformer, non-determinism, recursion, and termination

  • W. P. de Roever
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


An in both arguments continuous characterization of DIJKSTRA's weakest-precondition operator wp (R)(p) is investigated. A relationship between wp and full recursion is given. By way of example, a method for expressing total correctness of non-deterministic recursive procedures by means of inductive assertion patterns is presented and shown to be adequate (complete), thus refining work of de BAKKER's and MEERTENS'.


Recursive Call Recursive Procedure Computation Sequence Total Correctness Program Construct 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. [1]
    de BAKKER, Fixed pt.appr. in sem., Found.Cptr.Sc., MCT63, Math.Centre, A'dam (75).Google Scholar
  2. [2]
    de BAKKER, Termination of nondet.progr., Proc.3rd coll.Aut., Lang.& Progr., Edinb. (76).Google Scholar
  3. [3]
    de BAKKER & MEERTENS, Completeness ind.assertion method, JCSS 11,3 (75).Google Scholar
  4. [4]
    de BAKKER & de ROEVER, Calculus for rec.progr.schemes,Proc.1st coll.Aut., Lang. & Progr., North-H. (72).Google Scholar
  5. [5]
    BURSTALL, Prog.proving as hand sim. with little induction, Inf. Processing 74, North-H.Google Scholar
  6. [6]
    DIJKSTRA, Guarded commands, CACM 18,8 (75).Google Scholar
  7. [7]
    DIJKSTRA, A discipline in programming, Pr.Hall (76).Google Scholar
  8. [8]
    EGLI, A math. model for non-det. comp., Forsch. Inst. ETH Zurich (75).Google Scholar
  9. [9]
    GORDON, Op. reasoning & den. sem., in proving & improving programs, IRIA (75).Google Scholar
  10. [10]
    HITCHCOCK & PARK, Induction rules and proofs of termination, in (see[4]).Google Scholar
  11. [11]
    HOARE, A model for progr. lang. sem., corrected draft, jan.76, Belfast.Google Scholar
  12. [12]
    HOARE, Some prop. of non-det. comp., manuscript, march 76, Belfast.Google Scholar
  13. [13]
    MILNER, Processes: a math. model for comp. agents, Proc. Bristol 73 Logic Coll, North-H.Google Scholar
  14. [14]
    PLOTKIN, A powerdomain construction, Dept. Art. Int., Univ. of Edinb. (75).Google Scholar
  15. [15]
    de ROEVER, Rec. progr. schemes: sem. & proof th., MCT, Math.Centre, A'dam (76).Google Scholar
  16. [16]
    de ROEVER, Rec. & par. mech.: ax. approach, Proc. 2nd coll. Aut.,Lang & Progr., Springer C.Sc. 14 (74).Google Scholar
  17. [17]
    SCOTT, Continuous lattices, Proc.7thDalhousie Conf.,Springer Lect. Notes.Google Scholar
  18. [18]
    SCOTT, Private communication (75).Google Scholar
  19. [19]
    STRACHEY & WADSWORTH, Continuations, Techn. Monogr. PRG-11, Progr. Res. Group, Oxford (74).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • W. P. de Roever
    • 1
    • 2
  1. 1.Université de RennesFrance
  2. 2.Mathematisch CentrumAmsterdamNetherlands

Personalised recommendations