Dynamic IFC Theorems for Free!
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.
PDF AbstractCategories
Programming Languages
Cryptography and Security
Logic in Computer Science
Datasets
Add Datasets
introduced or used in this paper
