Verification Conditions are Code
Verification Conditions are Code
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verification conditions which support a Hoare Logic program derivation are themselves sufficient to construct a correct implementation of the given pre-, post- condition specification. This property is mainly of theoretical interest, though it is possible that it may have some practical use, for example if predicative programming methodology is adopted. The result is shown to hold for both the original, partial correctness, Hoare logic, and also a variant for total correctness derivations.
431-477
Gravell, Andrew M
f3a261c5-f057-4b5f-b6ac-c1ca37d72749
April 2006
Gravell, Andrew M
f3a261c5-f057-4b5f-b6ac-c1ca37d72749
Gravell, Andrew M
(2006)
Verification Conditions are Code.
Acta Informatica, 43, .
Abstract
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verification conditions which support a Hoare Logic program derivation are themselves sufficient to construct a correct implementation of the given pre-, post- condition specification. This property is mainly of theoretical interest, though it is possible that it may have some practical use, for example if predicative programming methodology is adopted. The result is shown to hold for both the original, partial correctness, Hoare logic, and also a variant for total correctness derivations.
Text
vcs3preprint.pdf
- Other
More information
Published date: April 2006
Identifiers
Local EPrints ID: 262472
URI: http://eprints.soton.ac.uk/id/eprint/262472
PURE UUID: 4e11d0b3-f8b2-4c90-b054-d3877f2cd431
Catalogue record
Date deposited: 03 May 2006
Last modified: 14 Mar 2024 07:12
Export record
Contributors
Author:
Andrew M Gravell
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics