Add to ORKGAbstract. I explain how the partial correctness interpretation of a Hoare triple can be characterised as the greatest fixed point of a function, and how the total correctness interpretation can be seen as the least fixed point of the same function. In the latter case, I provide a necessary and sufficient condition for the characterisation to be accurate: that the pro-gramming language admits no infinite branching.
Abstract. We investigate the structure of the degrees of provability, which measure the proof-theore...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Co...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotonefunction over a complete...
AbstractWe investigate various fixpoint operators in a semiring-based setting that models a general ...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Completeness in abstract interpretation is an ideal situation where the abstract semantics is able ...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
In the context of abstract interpretation for languages without higher-order features we study the n...
Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy...
ABSTRACT. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
Abstract. We investigate the structure of the degrees of provability, which measure the proof-theore...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Co...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotonefunction over a complete...
AbstractWe investigate various fixpoint operators in a semiring-based setting that models a general ...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Completeness in abstract interpretation is an ideal situation where the abstract semantics is able ...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
In the context of abstract interpretation for languages without higher-order features we study the n...
Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy...
ABSTRACT. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
Abstract. We investigate the structure of the degrees of provability, which measure the proof-theore...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...