We launch the new probabilistic model checker S torm. It features the analysis of discrete-
and continuous-time variants of both Markov chains and MDPs. It supports the P rism and …

Preventing and controlling outbreaks of infectious diseases such as pandemic influenza is a
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …

We present techniques for the analysis of infinite state probabilistic programs to synthesize
probabilistic invariants and prove almost-sure termination. Our analysis is based on the …

Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

This paper presents a wp–style calculus for obtaining bounds on the expected run–time of
probabilistic programs. Its application includes determining the (possibly infinite) expected …

This paper presents a new static analysis for deriving upper bounds on the expected
resource consumption of probabilistic programs. The analysis is fully automatic and derives …

We propose a framework to prove almost sure termination for probabilistic programs with
real valued variables. It is based on ranking supermartingales, a notion analogous to …

The formal analysis of critical systems is supported by a vast space of modelling formalisms
and tools. The variety of incompatible formats and tools however poses a significant …

We consider nondeterministic probabilistic programs with the most basic liveness property of
termination. We present efficient methods for termination analysis of nondeterministic …

Termination is one of the basic liveness properties, and we study the termination problem for
probabilistic programs with real-valued variables. Previous works focused on the qualitative …