A Complete Axiomatic System for Proving Deductions About Recursive Programs
Name
MIT-LCS-TM-096.pdf
Size
4.58 MB
Format
Adobe PDF
Checksum (MD5)
4c8aa1dd49a0a46fa48277109a8cff7c
Author(s)
Harel, David
Pnueli, Amir
Stavi, Jonathan
Date Issued
February 1978
Series/Report no.
MIT-LCS-TM-096
Abstract
Denoting a version of Hoare's system for proving partial correctness of recursive programs by H, we present an extension D which may be thought of a H u {^,v,∃,∀} uH^-1, including the rules of H, four special purpose rules and inverse rules to those of Hoare. D is shown to be a complete system (in Cook's sense) for proving deductions of the form σ1.....σn ?σ over a language, the wff's of which are assertions in some assertion language L and partial correctness specifications of the form p{α}q. All valid formulae of L are taken as axioms of D. It is shown that D is sufficient for proving partial correctness, total correctness and program equivalence as well as other important properties of programs, the proofs of which are impossibel in H. The entire presentation is worked out in the framework of nondeterministic programs employing iteration and mutually recursive procedures.
Persistent DSpace Link
