Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …

Logical relations constitute a key method for reasoning about contextual equivalence of
programs in higher-order languages. They are usually developed on a per-case basis, with …

To ensure that secure applications do not leak their secrets, they are required to uphold
several security properties such as spatial and temporal memory safety as well as …

Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …

Secure compilation investigates when compilation chains preserve security properties. Over
the years, different formal criteria and proof techniques have been put forward for proving a …

This paper discusses the relationship between two frameworks: universal composability
(UC) and robust compilation (RC). In cryptography, UC is a framework for the specification …

RUB-Repository - A formal framework for correct and secure compilation Deutsch OPUS UB
Bochum RUB » Bibliotheksportal Home Search Browse Publish FAQ OPUS UB Bochum A …

Many people contributed to this PhD in various ways, both directly in a technical sense and
indirectly in an emotional one. I would like to spend some time here to acknowledge the …

Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …

This article discusses the relationship between two frameworks: universal composability ()
and robust compilation (RC). In cryptography, is a framework for the specification and …