41 citations · 58 across the 7 of their papers we have counts for
5 papers · 1 filter
Extending Equational Monadic Reasoning with Monad Transformers
Reynald Affeldt, David Nowak
There is a recent interest for the verification of monadic programs using proof assistants. This line of research raises the question of the integration of monad transformers, a st…
A Trustful Monad for Axiomatic Reasoning with Probability and Nondeterminism
Reynald Affeldt, Jacques Garrigue, David Nowak +1
The algebraic properties of the combination of probabilistic choice and nondeterministic choice have long been a research topic in program semantics. This paper explains a formaliz…
(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic
Vlad Rusu, David Nowak
Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems…
On the freeze quantifier in Constraint LTL: decidability and complexity
Stéphane Demri, Ranko Lazic, David Nowak
Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze q…
Reasoning about transfinite sequences
Stéphane Demri, David Nowak
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequenc…