Network protocol reverse engineering is an important challenge with many security
applications. A popular kind of method leverages network message traces. These methods …

Wir studieren die quantitative Analyse probabilistischer Programme. Dabei untersuchen wir
vornehmlich zwei Aspekte: Die Analysetechniken selbst, sowie die komplexitäts-bzw …

Relational program verification is a variant of program verification where one can reason
about two programs and as a special case about two executions of a single program on …

Almost-sure termination is an important correctness property for probabilistic programs, and
a number of program logics have been developed for establishing it. However, these logics …

Probabilistic couplings are the foundation for many probabilistic relational program logics
and arise when relating random sampling statements across two programs. In relational …

We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As
part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic …

Constructive type theory combines logic and programming in one language. This is useful
both for reasoning about programs written in type theory, as well as for reasoning about …

Probabilistic programming provides a convenient lingua franca for writing succinct and
rigorous descriptions of probabilistic models and inference tasks. Several probabilistic …

The overarching goal of this 2-phase study was to investigate the contributions of relational
reasoning to mathematical thinking and performance for 790 primary and middle-school …

We introduce eRHL, a program logic for reasoning about relational expectation properties of
pairs of probabilistic programs. eRHL is quantitative, ie, its pre-and post-conditions take …