Quantum computing is expected to exponentially outperform classic computing on a broad
set of problems, including encryption, machine learning, and simulations. It has an impact …

Quantum programming is an emerging area developed in last 2 decades from the
multidisciplinary research on quantum computing. Quantum computing combines the idea of …

Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …

Emerging high-performance architectures are anticipated to contain unreliable components
that may exhibit soft errors, which silently corrupt the results of computations. Full detection …

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 inference is a key mechanism for reasoning about probabilistic programs.
Since exact inference is theoretically expensive, most probabilistic inference systems today …

Program logics for bug-finding (such as the recently introduced Incorrectness Logic) have
framed correctness and incorrectness as dual concepts requiring different logical …

We introduce a symbolic model checking procedure for Probabilistic Computation Tree
Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics …

We propose an approach to quantify interference in a simple imperative language that
includes a looping construct. In this paper we focus on a particular case of this definition of …

We present a new proof rule for proving almost-sure termination of probabilistic programs,
including those that contain demonic non-determinism. An important question for a …