Towards a higher-order mathematical operational semantics
Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …
Bialgebraic Reasoning on Higher-Order Program Equivalence
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 …
programs in higher-order languages. They are usually developed on a per-case basis, with …
Stateful structural operational semantics
Compositionality of denotational semantics is an important concern in programming
semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees …
semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees …
Fully abstract and robust compilation: and how to reconcile the two, abstractly
The most prominent formal criterion for secure compilation is full abstraction, the
preservation and reflection of contextual equivalence. Recent work introduced robust …
preservation and reflection of contextual equivalence. Recent work introduced robust …
Secure composition of robust and optimising compilers
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 …
several security properties such as spatial and temporal memory safety as well as …
Higher-Order Mathematical Operational Semantics
Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …
Abstract congruence criteria for weak bisimilarity
We introduce three general compositionality criteria over operational semantics and prove
that, when all three are satisfied together, they guarantee weak bisimulation being a …
that, when all three are satisfied together, they guarantee weak bisimulation being a …
A formal framework for correct and secure compilation
C Abate - 2023 - hss-opus.ub.ruhr-unibochum.de
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 …
Bochum RUB » Bibliotheksportal Home Search Browse Publish FAQ OPUS UB Bochum A …
[PDF][PDF] Towards a Higher-Order Mathematical Operational Semantics
Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …
Publications of Dominique Devriese
DNRD Bites, DN Seminars - cs.kuleuven.be
Department of Computer Science search home imec-DistriNet Research Group, KU Leuven
Menu Login account_box About us keyboard_arrow_down Contact information How to …
Menu Login account_box About us keyboard_arrow_down Contact information How to …