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 …

The article investigates behavioural equivalence between programs in a call-by-value
functional language extended with a signature of (algebraic) effect-triggering operations …

Up-to techniques are a well-known method for enhancing coinductive proofs of behavioural
equivalences. We introduce up-to techniques for behavioural metrics between systems …

Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallel composition
operator, which enables reasoning about concurrent programs. However, CKA …

Bisimilarity as an equivalence notion of systems has been central to process theory. Due to
the recent rise of interest in quantitative systems (probabilistic, weighted, hybrid, etc.) …

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

Deductive verification techniques based on program logics (ie, the family of Floyd-Hoare
logics) are a powerful approach for program reasoning. Recently, there has been a trend of …

In this paper, we introduce open parity games, which is a compositional approach to parity
games. This is achieved by adding open ends to the usual notion of parity games. We …

This paper presents a novel formalisation of algebraic effects with equations in Cubical
Agda. Unlike previous work in the literature that employed setoids to deal with equations, the …

Hidden Markov Models, HMM's, are mathematical models of Markov processes with state
that is hidden, but from which information can leak. They are typically represented as 3-way …