Soundness of Hoare's logic: an automated proof using LCF

Authors:
Stefan Sokolowski
Affiliations:
Univ. of Gdan´sk, Gdan´sk, Poland
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1987

Citing 2
Cited 1

An axiomatic basis for computer programming

Communications of the ACM
The Denotational Description of Programming Languages: An Introduction

The Denotational Description of Programming Languages: An Introduction

Mechanically Verifying Concurrent Programs with the Boyer-Moore Prove

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a natural deduction proof of Hoare's logic carried out by the Edinburgh LCF theorem prover. The emphasis is on the way Hoare's theory is presented to the LCF, which looks very much like an exposition of syntax and semantics to human readers; and on the programmable heuristics (tactics). We also discuss some problems and possible improvements to the LCF.