Dynamic IFC Theorems for Free!

May 10, 2020 Β· Declared Dead Β· πŸ› IEEE Computer Security Foundations Symposium

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Maximilian Algehed, Jean-Philippe Bernardy, Catalin Hritcu arXiv ID 2005.04722 Category cs.PL: Programming Languages Cross-listed cs.CR, cs.LO Citations 1 Venue IEEE Computer Security Foundations Symposium Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted