Abstract-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. The system, theorems and examples have all been formalized in Coq.
Nanevskis et al. REF propose Relational Hoare Type Theory, which allows expressing information flow policies including declassification as discussed in this paper (and other security properties) using dependent types.
Verification of Information Flow and Access Control Policies with Dependent Types
2011 IEEE Symposium on Security and Privacy
2011 IEEE Symposium on Security and Privacy
Computer Science