Dynamic IFC Theorems for Free!
Paper i proceeding, 2021
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.
Författare
Maximilian Algehed
Chalmers, Data- och informationsteknik, Funktionell programmering
Jean-Philippe Bernardy
Göteborgs universitet
Catalin Hritcu
Max-Planck-Institut für Sicherheit und Privatsphäre
2021 IEEE 34TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2021)
1940-1434 (ISSN) 2374-8303 (eISSN)
65-78978-1-7281-7607-9 (ISBN)
IEEE 34th Computer Security Foundations Symposium (CSF)
, ,
, ,
Ämneskategorier
Algebra och logik
Teoretisk kemi
Matematisk analys
DOI
10.1109/CSF51468.2021.00005