Add to ORKGWe 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
Investigating soundness and completeness of verification calculi for imperative programming language...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Abstract. Matching logic has been recently proposed as an alternative program verification approach....
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
We propose a proof method in the style of Hoare's logic, aimed at providing a unifying framework f...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
interpretation is a well-known and extensively used method to extract over-approximate program invar...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
This paper is a systematic study of verification conditions and their use in the context of program ...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Investigating soundness and completeness of verification calculi for imperative programming language...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Abstract. Matching logic has been recently proposed as an alternative program verification approach....
AbstractWe explore conservative refinements of specifications. These form a quite appropriate framew...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
We propose a proof method in the style of Hoare's logic, aimed at providing a unifying framework f...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
Formal reasoning about computer programs can be based directly on the semantics of the programming l...
interpretation is a well-known and extensively used method to extract over-approximate program invar...
This report deals with program verification based on a refined Hoare-logic which allows to handle pr...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
AbstractWe propose a new approach to delineating logics of programs, based directly on inductive def...
This paper is a systematic study of verification conditions and their use in the context of program ...
AbstractGeneralized Hoare logic (GHL) is a formal logical system for proving invariance properties o...
Investigating soundness and completeness of verification calculi for imperative programming language...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Abstract. Matching logic has been recently proposed as an alternative program verification approach....