Add to ORKGHoare Logic has a long tradition in formal verification and has been continuously developed and used to verify a broad class of programs, including sequential, object-oriented and concurrent programs. The purpose of this work is to provide a detailed and accessible exposition of the several ways the user can conduct, explore and write proofs of correctness of sequential imperative programs with Hoare logic and the ISABELLE proof assistant. With the proof language Isar, it is possible to write structured, readable proofs that are suitable for human understanding and communication
International audiencePartial correctness is perhaps the most important functional property of algo-...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
Investigating soundness and completeness of verification calculi for imperative programming language...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
In the following theories a formalization of the Owicki-Gries and the rely-guarantee methods is pres...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
AbstractWe present a proof method in the style of Hoare's logic, aimed at providing a unifying frame...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
Investigating soundness and completeness of verification calculi for imperative programming language...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
In the following theories a formalization of the Owicki-Gries and the rely-guarantee methods is pres...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
AbstractWe present a proof method in the style of Hoare's logic, aimed at providing a unifying frame...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
The proof assistant Isabelle/HOL is based on an extension of Higher-Order Logic (HOL) with ad hoc ov...