State-separating proofs (SSP) is a recent methodology for structuring game-based
cryptographic proofs in a modular way. While very promising, this methodology was …

This paper proposes a general semantic framework for verifying programs with arbitrary
monadic side-effects using Dijkstra monads, which we define as monad-like structures …

Weakest precondition transformers are useful tools in program verification. One of their key
properties is compositionality, that is, the weakest precondition predicate transformer (wppt …

This paper presents a specification framework for monadic, recursive, interactive programs
that supports auto-active verification, an approach that combines user-provided guidance …

State-separating proofs (SSP) is a recent methodology for structuring game-based
cryptographic proofs in a modular way, by using algebraic laws to exploit the modular …

We start with some terminology: a posteriori verification (also called post hoc ver ification or
phv for short) designates the approach where a program is verified after it has been …

Weakest precondition transformers are useful tools in program verification. One of their key
properties is composability, that is, the weakest precondition predicate transformer (wppt for …

Computational monads are a convenient algebraic gadget to uniformly represent sidee ects
in programming languages, such as mutable state, divergence, exceptions, or …

Computational monads are a convenient algebraic gadget to uniformly represent side-
effects in programming languages, such as mutable state, divergence, exceptions, or non …

The aim of this paper is to provide a semantic framework for specifying and verifying
programs with arbitrary side-effects modeled by computational monads [Moggi 1989]. We …