Abstract

Much research in axiomatic semantics suffers from a lack of formality. In particular, most proposed verification calculi for imperative programs dealing with recursive procedures are known to be unsound or incomplete. Focussing on total correctness, we present a new consequence rule which yields a sound and complete Hoare-style calculus in the presence of parameterless recursive procedures. Both, the standard consequence and an improved rule of adaptation are instances of our new rule. This work has been developed under the auspices of the computer-aided proof system Lego. The rigorous treatment of auxiliary variables has been crucial for establishing our results. A comparison with VDM reinforces our view that auxiliary variables deserve to be treated seriously.

Citations

1219	An axiomatic basis for computer programming - HOARE - 1969
504	Assigning meanings to programs - FLOYD - 1967
107	Soundness and completeness of an axiom system for program verification - Cook - 1978
76	Procedures and parameters: An axiomatic approach - Hoare - 1970
67	Methods and logics for proving programs - Cousot - 1990
65	Ten years of Hoare's logic, a survey, part I - Apt - 1981
57	Mechanizing programming logics in higher order logic - Gordon - 1989
19	First-Order Dynamic Logic, volume 68 - Harel - 1979
17	F.S.: Proving total correctness of recursive procedures - America, Boer - 1990
5	A system of proof rules for the correctness of iterative programs – some notational and organisational suggestions. Unpublished - Aczel - 1982
1	Meertens. Completeness with ��nite systems of intermediate assertions for recursive program schemes - Apt, Lambert - 1980
1	The Science of Computer Programming, chapter 16 - Gries - 1981