A semigroup-based setting for developing Hoare logics and refinement calculi is introduced together with procedures for translating between verification and refinement proofs. A new Hoare logic for multirelations and two minimalist generic verification and refinement components, implemented in an interactive theorem prover, are presented as applications that benefit from this generalisation
Matching logic has been recently proposed as an alternative program verification approach. Unlike ...
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...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
We present simple new Hoare logics and refinement calculi for hybrid systems in the style of differe...
Relational Hoare logics extend the applicability of modular, deductive verification to encompass imp...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Matching logic reachability has been recently proposed as an alternative program verification appro...
AbstractAn embedding of the relations in the predicate transformers, analogous to that of the intege...
Learning Guide for the CST Part II course. This document aims to provide background reading to suppo...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
Investigating soundness and completeness of verification calculi for imperative programming language...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
Matching logic has been recently proposed as an alternative program verification approach. Unlike ...
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...
This paper presents a new theoretical result concerning Hoare Logic. It is shown here that the verif...
We present simple new Hoare logics and refinement calculi for hybrid systems in the style of differe...
Relational Hoare logics extend the applicability of modular, deductive verification to encompass imp...
Enabling Hoare-style reasoning for low-level code is attractive since it opens the way to regain str...
Matching logic reachability has been recently proposed as an alternative program verification appro...
AbstractAn embedding of the relations in the predicate transformers, analogous to that of the intege...
Learning Guide for the CST Part II course. This document aims to provide background reading to suppo...
In this paper, we combine a Hoare logic with a typed ¿-calculus to create a reliable tool for derivi...
Investigating soundness and completeness of verification calculi for imperative programming language...
In systems verification we are often concerned with multiple, inter-dependent properties that a pro-...
Abstract – This paper presents a new approach to formalizing the general rules of the Hoare logic. O...
In several papers,e.g. [COOK] or [APT] the problems of correctness and completeness of Hoare calculi...
Matching logic has been recently proposed as an alternative program verification approach. Unlike ...
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...
DOI
Add to ORKG