AbstractWe explore conservative refinements of specifications. These form a quite appropriate framework for a proof theory for program inclusion based on a proof theory for program correctness.We propose two formalized proof methods for program inclusion and prove these to be sound. Both methods are incomplete but seem to cover most natural cases
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...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
We explore conservative refinements of specifications. These form a quite appropriate framework for...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
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...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
AbstractIn 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algo...
AbstractWe develop the proof theory of Hoare's logic for the partial correctness of while- programs ...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
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...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
We explore conservative refinements of specifications. These form a quite appropriate framework for...
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
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...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
AbstractIn 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algo...
AbstractWe develop the proof theory of Hoare's logic for the partial correctness of while- programs ...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
AbstractIt is known that incompleteness of Hoare's logic relative to certain data type specification...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
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...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
DOI
Add to ORKG