Add to ORKGThis paper presents Hoarescope, a program that helps to prove partial correctness assertions of AL(N)-programs using Hoare calculus. This paper also presents Presprover, a program for proving satisfiability and validity of formulas of Presburger arithmetic.
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
This paper is concerned with the semantics (or computational power) of very simple loop programs ove...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
AbstractVersions of Hoare logic have been introduced to prove partial and total correctness properti...
AbstractWe develop the proof theory of Hoare's logic for the partial correctness of while- programs ...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
Abstract. I describe the implementation of two complete decision procedures for integer Presburger a...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
AbstractThis paper is concerned with the relationship between the correctness of programs and the sa...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
We explore conservative refinements of specifications. These form a quite appropriate framework for...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
This paper is concerned with the semantics (or computational power) of very simple loop programs ove...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
AbstractA survey of various results concerning the use of Hoare's logic in proving correctness of no...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
AbstractVersions of Hoare logic have been introduced to prove partial and total correctness properti...
AbstractWe develop the proof theory of Hoare's logic for the partial correctness of while- programs ...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
Abstract. I describe the implementation of two complete decision procedures for integer Presburger a...
Hoare logics are proof systems that allow one to formally establish properties of computer programs....
AbstractThis paper is concerned with the relationship between the correctness of programs and the sa...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
We explore conservative refinements of specifications. These form a quite appropriate framework for...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
This paper is concerned with the semantics (or computational power) of very simple loop programs ove...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...