Dynamic IFC Theorems for Free!

05/10/2020
by   Maximilian Algehed, et al.
0

We show that noninterference and transparency, the key soundness theorems for dynamic IFC libraries, can be obtained "for free", as direct consequences of the more general parametricity theorem of type abstraction. This allows us to give very short soundness proofs for dynamic IFC libraries such as faceted values and LIO. Our proofs stay short even when fully mechanized for Agda implementations of the libraries in terms of type abstraction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2014

Proofs of two Theorems concerning Sparse Spacetime Constraints

In the SIGGRAPH 2014 paper [SvTSH14] an approach for animating deformabl...
research
08/21/2019

Free Theorems Simply, via Dinaturality

Free theorems are a popular tool in reasoning about parametrically polym...
research
01/25/2013

Recycling Proof Patterns in Coq: Case Studies

Development of Interactive Theorem Provers has led to the creation of bi...
research
11/11/2019

Program Synthesis by Type-Guided Abstraction Refinement

We consider the problem of type-directed component based synthesis where...
research
02/05/2020

Combinatorial proofs of two theorems of Lutz and Stull

The purpose of this note is to give combinatorial-geometric proofs for t...
research
07/26/2018

On the logical complexity of cyclic arithmetic

We study the logical complexity of proofs in cyclic arithmetic (CA), as ...
research
01/21/2020

Some General Structure for Extremal Sparsification Problems

This paper is about a branch of theoretical computer science that studie...

Please sign up or login with your details

Forgot password? Click here to reset