Randomization is a powerful technique to create robust controllers, in particular in partially
observable settings. The degrees of randomization have a significant impact on the system …

In many synthesis problems, it can be essential to generate implementations which not only
satisfy functional constraints but are also randomized to improve variety, robustness, or …

The increasing use of autonomy for safety-critical tasks, from operating power grids to
driving cars, has led to an acute need for reliable and secure systems. The ideal approach to …

This dissertation considers the problem of learning and teaching Boolean task
specifications, such as automata, using demonstrations. The resulting framework bridges …

High level declarative constraints provide a powerful (and popular) way to define and
construct control policies; however, most synthesis algorithms do not support specifying the …

Many systems exhibit probabilistic behavior, such as randomized protocols, communication
protocols, or biological systems. Probabilistic model checking is a common way to analyze …

Stochastic multiplayer games (SMGs) have gained attention in the field of strategy synthesis
for multi-agent reactive systems. However, standard SMGs are limited to modeling systems …

Diversity in the exhibited behavior of a given system is a desirable characteristic in a variety
of application contexts. Synthesis of conformant implementations often proceeds by …

Algorithmic Improvisation, also called control improvisation or controlled improvisation, is a
new framework for automatically synthesizing systems with specified random but …

This open access two-volume set LNCS 13371 and 13372 constitutes the refereed
proceedings of the 34rd International Conference on Computer Aided Verification, CAV …