AbstractWe develop the proof theory of Hoare's logic for the partial correctness of while- programs applied to arithmetic as it is defined by Peano's axioms. By representing the strongest postcondition calculus in Peano arithmetic PA, we are able to show that Hoare's logic over PA is equivalent to PA itself
Abstract To the axioms of Peano arithmetic formulated in a language with an additional unary predica...
This paper proposes to replace PA, Peano Arithmetic, by a theory APA defined in terms of (i) a set o...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
AbstractThree theorems are proven which reconsider the completeness of Hoare's logic for the partial...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
It is known (Bergstra and Tucker (1982) J. Comput. System Sci. 25, 217) that if the Hoare rules are ...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Co...
This paper offers an elementary proof that formal arithmetic is consistent. The system that will be ...
AbstractA well-known result of Cook asserts the completeness of Hoare's logic for while-programs rel...
Abstract To the axioms of Peano arithmetic formulated in a language with an additional unary predica...
This paper proposes to replace PA, Peano Arithmetic, by a theory APA defined in terms of (i) a set o...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
AbstractThree theorems are proven which reconsider the completeness of Hoare's logic for the partial...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
It is known (Bergstra and Tucker (1982) J. Comput. System Sci. 25, 217) that if the Hoare rules are ...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Co...
This paper offers an elementary proof that formal arithmetic is consistent. The system that will be ...
AbstractA well-known result of Cook asserts the completeness of Hoare's logic for while-programs rel...
Abstract To the axioms of Peano arithmetic formulated in a language with an additional unary predica...
This paper proposes to replace PA, Peano Arithmetic, by a theory APA defined in terms of (i) a set o...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
DOI
Add to ORKG