DeepAI AI Chat
Log In Sign Up

A categorical approach to secure compilation

04/07/2020
by   Stelios Tsampas, et al.
0

We introduce a novel approach to secure compilation based on maps of distributive laws. We demonstrate through four examples that the coherence criterion for maps of distributive laws can potentially be a viable alternative for compiler security instead of full abstraction, which is the preservation and reflection of contextual equivalence. To that end, we also make use of the well-behavedness properties of distributive laws to construct a categorical argument for the contextual connotations of bisimilarity.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/12/2018

Is the security of quantum cryptography guaranteed by the laws of physics?

It is often claimed that the security of quantum key distribution (QKD) ...
05/07/2022

Weakening and Iterating Laws using String Diagrams

Distributive laws are a standard way of combining two monads, providing ...
02/05/2019

Integrating Amdahl-like Laws and Divisible Load Theory

Integrating Amdahl's and Amdahl-like laws with Divisible Load Theory pro...
09/04/2017

Distributive Laws for Monotone Specifications

Turi and Plotkin introduced an elegant approach to structural operationa...
12/31/2019

Interaction laws of monads and comonads

We introduce and study functor-functor and monad-comonad interaction law...
01/15/2021

Secure Optimization Through Opaque Observations

Secure applications implement software protections against side-channel ...
08/17/2018

Proving Type Class Laws for Haskell

Type classes in Haskell are used to implement ad-hoc polymorphism, i.e. ...