Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are
therefore a powerful semantic foundation for modeling concurrent systems with random …

Proving the security of complex protocols is a crucial and very challenging task. A widely
used approach for reasoning about such protocols in a modular way is universal …

Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic
primitives in computational models. It captures reasoning patterns that are common in …

The universal composability (UC) framework is the established standard for analyzing
cryptographic protocols in a modular way, such that security is preserved under concurrent …

Abstract Probabilistic Automata (PAs) are a widely-recognized mathematical framework for
the specification and analysis of systems with non-deterministic and stochastic behaviors …

In addition to rigorously checking whether a system conforms to a specification, model
checking can provide valuable feedback in the form of succinct and understandable …

Abstract Probabilistic Automata (PAs) are a widely-recognized mathematical framework for
the specification and analysis of systems with non-deterministic and stochastic behaviors …

We view a distributed system as a graph of active locations with unidirectional channels
between them, through which they pass messages. In this context, the graph structure of a …

Probabilistic Automata (PAs) are a recognized framework for modeling and analysis of
nondeterministic systems with stochastic behavior. Recently, we proposed Abstract …

Browser-based security protocols perform cryptographic tasks within the constraints of
commodity browsers. They are the bearer protocols for many security critical applications on …