AbstractA syntax-directed generalization of Owicki–Gries's Hoare logic for a parallel while language is presented. The rules are based on Hoare asserted programs of the form {Γ,A} p {B, Δ} where Γ, Δ are sets of first-order formulas. These triples are interpreted with respect to an operational semantics involving potential computations where Γ, Δ are sets of invariants
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
How can we rigorously prove that an algorithm does what we think it does? Logically verifying progr...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
AbstractA syntax-directed generalization of Owicki–Gries's Hoare logic for a parallel while language...
In the following theories a formalization of the Owicki-Gries and the rely-guarantee methods is pres...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
International audienceA logical framework is presented for defining semantics of programs that satis...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
How can we rigorously prove that an algorithm does what we think it does? Logically verifying progr...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
AbstractA syntax-directed generalization of Owicki–Gries's Hoare logic for a parallel while language...
In the following theories a formalization of the Owicki-Gries and the rely-guarantee methods is pres...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
International audienceA logical framework is presented for defining semantics of programs that satis...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
How can we rigorously prove that an algorithm does what we think it does? Logically verifying progr...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
DOI
Add to ORKG