We present the probabilistic model checker Storm. Storm supports the analysis of discrete-
and continuous-time variants of both Markov chains and Markov decision processes. Storm …

Methods for the formal verification and specification of systems are a critical tool for the
development of correct systems, and they have been applied to the design of hardware …

Probabilistic predicates generalize standard predicates over a state space; with probabilistic
predicate transformers one thus reasons about imperative programs in terms of probabilistic …

In this paper a programming language, qGCL, is presented for the expression of quantum
algorithms. It contains the features required to program a 'universal'quantum computer …

Parallel systems (such as operating systems, telecommunication systems, aircraft controlling
systems, banking systems, etc.) arise in many industrial applications. For applications where …

Bisimulations that abstract from internal computation have proven to be useful for verification
of compositionally defined transition system. In the literature of probabilistic extensions of …

Formal verification of probabilistic algorithms Page 1 Technical Report Number 566
Computer Laboratory UCAM-CL-TR-566 ISSN 1476-2986 Formal verification of …

Following earlier models, we lift standard deterministic and nondeterministic semantics of
imperative programs to probabilistic semantics. This semantics allows for random external …

This paper proposes a simple operational semantics of pGCL, Dijkstra's guarded command
language extended with probabilistic choice, and relates this to pGCL's wp-semantics by …

Interactive programs allow users to engage in input and output throughout execution. The
ubiquity of such programs motivates the development of models for reasoning about their …