A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

We introduce the language QML, a functional language for quantum computations on finite
types. Its design is guided by its categorical semantics: QML programs are interpreted by …

The continued development of efficient automated decision procedures has spurred the
resurgence of research on symbolic execution over the past decade. Researchers have …

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 …

Randomized algorithms are widely used for finding efficiently approximated solutions to
complex problems, for instance primality testing and for obtaining good average behavior …

The standard approach to program transformation involves the use of discrete logical
reasoning to prove that the transformation does not change the observable semantics of the …

The probabilistic guarded-command language (pGCL) contains both demonic and
probabilistic non-determinism, which makes it suitable for reasoning about distributed …

Probability, be it inherent or explicitly introduced, has become an important issue in the
verification of programs. In this paper we study a formalism which allows reasoning about …

Alea jacta est. With the printing of this thesis, almost five years of research end. This was a
period of hard work, of astonishing elegance and beauty present in concurrency theory, with …

Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of
quantum programs has become a major concern. Pioneering research over the past years …