AbstractWe show that some well-known rules in a Hoare-style proof system for total correctness of recursive procedures can interact in such a way that they yield incorrect results. The problem is connected to the quantification scope of certain variables in the proof rules. By defining some restrictions on the applicability of the rules a system is obtained that is sound and complete. However, the completeness proof differs substantially from the original one. This technique is also applied to dynamic logic, where we show that the original proof rules for recursive procedures can be replaced by simpler and more natural ones, and that it is not ncessary to extend the programming language in order to arrive at a sound and complete proof syste...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Abstract. We report work in progress concerning the theoretical basis and the implementation in the ...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
We show that some well-known rules in a Hoare-style proof system for total correctness of recursive ...
AbstractWe show that some well-known rules in a Hoare-style proof system for total correctness of re...
We provide a sound and relatively complete Hoare logic for reasoning about partial correctness of re...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
Abstract. Four proof rules for recursive procedures in a Pascal-like language are presented. The mai...
It is known (Bergstra and Tucker (1982) J. Comput. System Sci. 25, 217) that if the Hoare rules are ...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
AbstractThe verification of programs that contain mutually recursive procedures is a difficult task,...
AbstractIn this paper processes specifiable over a non-uniform language are considered. The language...
Investigating soundness and completeness of verification calculi for imperative programming language...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Abstract. We report work in progress concerning the theoretical basis and the implementation in the ...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
We show that some well-known rules in a Hoare-style proof system for total correctness of recursive ...
AbstractWe show that some well-known rules in a Hoare-style proof system for total correctness of re...
We provide a sound and relatively complete Hoare logic for reasoning about partial correctness of re...
Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule dea...
Abstract. Four proof rules for recursive procedures in a Pascal-like language are presented. The mai...
It is known (Bergstra and Tucker (1982) J. Comput. System Sci. 25, 217) that if the Hoare rules are ...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
AbstractThe verification of programs that contain mutually recursive procedures is a difficult task,...
AbstractIn this paper processes specifiable over a non-uniform language are considered. The language...
Investigating soundness and completeness of verification calculi for imperative programming language...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
Abstract. We report work in progress concerning the theoretical basis and the implementation in the ...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...