Add to ORKGAbstract. This pearl introduces the Hoare state monad, a variant of the state monad that facilitates the verification of stateful programs.
Investigating soundness and completeness of verification calculi for imperative programming language...
International audienceThis paper proposes a general semantic framework for verifying programs with a...
Abstract. We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to rea...
This pearl examines how to verify functional programs written using the state monad. It uses Coq\u27...
Abstract. We present a scalable, practical Hoare Logic and refinement calculus for the nondeterminis...
The Dijkstra and Hoare monads have been introduced recently for capturing weak-est precondition comp...
International audienceWe provide a way to ease the verification of programs whose stateevolves monot...
We present an advanced modeling and verification toolbox for functional programs with state and exce...
Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsu...
Abstract. Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadical...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
We introduce an automatic method for producing stateful ML programs together with proofs of correctn...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
this paper self-contained, a simplified version of the theory is outlined in 1.7. The general idea o...
AbstractThe paper describes a decidable class of verification problems expressed in first order time...
Investigating soundness and completeness of verification calculi for imperative programming language...
International audienceThis paper proposes a general semantic framework for verifying programs with a...
Abstract. We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to rea...
This pearl examines how to verify functional programs written using the state monad. It uses Coq\u27...
Abstract. We present a scalable, practical Hoare Logic and refinement calculus for the nondeterminis...
The Dijkstra and Hoare monads have been introduced recently for capturing weak-est precondition comp...
International audienceWe provide a way to ease the verification of programs whose stateevolves monot...
We present an advanced modeling and verification toolbox for functional programs with state and exce...
Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadically-encapsu...
Abstract. Hoare Type Theory (HTT) combines a dependently typed, higher-order language with monadical...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
We introduce an automatic method for producing stateful ML programs together with proofs of correctn...
Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that prog...
this paper self-contained, a simplified version of the theory is outlined in 1.7. The general idea o...
AbstractThe paper describes a decidable class of verification problems expressed in first order time...
Investigating soundness and completeness of verification calculi for imperative programming language...
International audienceThis paper proposes a general semantic framework for verifying programs with a...
Abstract. We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to rea...