The design and control of autonomous systems that operate in uncertain or adversarial
environments can be facilitated by formal modeling and analysis. Probabilistic model …

Program synthesis is the task of automatically finding a program in the underlying
programming language that satisfies the user intent expressed in the form of some …

Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …

We present automatic verification techniques for the modelling and analysis of probabilistic
systems that incorporate competitive behaviour. These systems are modelled as turn-based …

We present automated techniques for the verification and control of partially observable,
probabilistic systems for both discrete and dense models of time. For the discrete-time case …

Smart contracts are computer programs that are executed by a network of mutually
distrusting agents, without the need of an external trusted authority. Smart contracts handle …

We consider partially observable Markov decision processes (POMDPs) with ω-regular
conditions specified as parity objectives. The class of ω-regular languages provides a robust …

This article presents resource-guided synthesis, a technique for synthesizing recursive
programs that satisfy both a functional specification and a symbolic resource bound. The …

Markov chain analysis is a key technique in formal verification. A practical obstacle is that all
probabilities in Markov models need to be known. However, system quantities such as …

The verification problem in MDPs asks whether, for any policy resolving the nondeterminism,
the probability that something bad happens is bounded by some given threshold. This …