Dependent Type Theory for Verification of Information Flow and Access Control Policies
- Autores: Aleksandar Nanevski, Anindya Banerjee, Deepak Garg
- Localización: ACM transactions on programming languages and systems, ISSN 0164-0925, Vol. 35, Nº 2, 2013
- Idioma: inglés
- Enlaces
-
Resumen
Dedicated to the memory of John C. Reynolds (1935--2013).
We present Relational Hoare Type Theory (RHTT), a novel language and verification system capable of expressing and verifying rich information flow and access control policies via dependent types. We show that a number of security policies which have been formalized separately in the literature can all be expressed in RHTT using only standard type-theoretic constructions such as monads, higher-order functions, abstract types, abstract predicates, and modules. Example security policies include conditional declassification, information erasure, and state-dependent information flow and access control. RHTT can reason about such policies in the presence of dynamic memory allocation, deallocation, pointer aliasing and arithmetic.
