Hoare's Logic is incomplete when it does not have to be
If Hoare's Logic, HL(A), is complete on a structure A, then the set PC(A) of all asserted programs true over A is recursive in the first order theory of A, Th(A). We show that this implication cannot be reversed.
Unable to display preview. Download preview PDF.
- 1.Bergstra, J.A., & J.V. Tucker, "Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs" (to appear in TCS. An earlier edition of this paper is registered at the Mathematical Centre as report IW 136/80).Google Scholar
- 2.Bergstra, J.A. & J.F. Tucker, "Expressiveness and the completeness of Hoare's logic", Mathematical Centre Report IW 143/80.Google Scholar
- 3.Bergstra, J.A., & J.V. Tucker, "Two theorems on the completeness of Hoare's Logic" Mathematical Centre Report IW?/81.Google Scholar
- 4.Cook, S.A., "Soundness and completeness of an axiom system for program verification", SIAM J. Computing? (1978) 70–90.Google Scholar
- 5.Harel, D., "First order dynamic logic", Lecture notes in Computer Science 68, Springer 1978.Google Scholar