Advertisement

A formalized proof system for total correctness of while programs

  • J. A. Bergstra
  • J. W. Klop
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 137)

Abstract

We introduce datatype specifications based on schemes, a slight generalization of first order specifications. For a schematic specification (Σ, \(\mathbb{E}\)), Hoare's Logic HL (Σ, \(\mathbb{E}\)) for partial correctness is defined as usual and on top of it a proof system (Σ, \(\mathbb{E}\)) ⊢ p → S ↓ for termination assertions is defined. The system is first order in nature, but we prove it sound and complete w.r.t. a second order semantics. We provide a translation of a standard proof system HLT(A) for total correctness on a structure A into our format.

Keywords

Proof System Scheme Variable Total Correctness Partial Correctness Proof Rule 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    APT, K.R. & E.R. OLDEROG, Proof rules dealing with fairness, Bericht Nr. 8104, March 1981, Institut für Informatik und Praktische Mathematik, Christian Albrechts-universität Kiel.Google Scholar
  2. [2]
    BERGSTRA, J.A. & J.W. KLOP, Proving program inclusion using Hoare's Logic, Mathematical Centre, Department of Computer Science, Research Report IW 176, Amsterdam 1981.Google Scholar
  3. [3]
    BERGSTRA, J.A. & J.W. KLOP, A formalized proof system for total correctness of while programs, Mathematical Centre, Department of Computer Science, Research Report IW 175, Amsterdam 1981.Google Scholar
  4. [4]
    BERGSTRA, J.A. & J.V. TUCKER, Hoare's Logic and Peano's Arithmetic, Mathematical Centre, Department of Computer Science, Research Report IW 160, Amsterdam 1981.Google Scholar
  5. [5]
    BERGSTRA, J.A. & J.V. TUCKER, The axiomatic semantics of while programs using Hoare's Logic, manuscript May 1981, definitive version in preparation.Google Scholar
  6. [6]
    GRÜMBERG O., N. FRANCEZ, J.A. MAKOWSKY & W.P. DE ROEVER, A Proof Rule for fair Termination of Guarded Commands, Report RUU-CS-81-2, Vakgroep Informatica Utrecht.Google Scholar
  7. [7]
    HAREL, D., First Order Dynamic Logic, Springer Lecture Notes in Comp. Sc. 68, 1979.Google Scholar
  8. [8]
    HAREL, D., Proving the correctness of regular deterministic programs: a unifying survey using dynamic Logic, T.C.S. 12(1) 61–83.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • J. A. Bergstra
    • 1
  • J. W. Klop
    • 2
  1. 1.Department of Computer ScienceUniversity of LeidenLeiden
  2. 2.Department of Computer ScienceMathematical CentreAmsterdam

Personalised recommendations