Dynamic IFC Theorems for Free!
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911782196477952 |
|---|---|
| author | Algehed, Maximilian Bernardy, Jean-Philippe Hritcu, Catalin |
| author_facet | Algehed, Maximilian Bernardy, Jean-Philippe Hritcu, Catalin |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2005_04722 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Dynamic IFC Theorems for Free! Algehed, Maximilian Bernardy, Jean-Philippe Hritcu, Catalin Programming Languages Cryptography and Security Logic in Computer Science 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. |
| title | Dynamic IFC Theorems for Free! |
| topic | Programming Languages Cryptography and Security Logic in Computer Science |
| url | https://arxiv.org/abs/2005.04722 |