Stack-based access control and secure information flow

DOI10.1017/S0956796804005453zbMath1077.68569MaRDI QIDQ4676153

Anindya Banerjee, David A. Naumann

Publication date: 3 May 2005

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items

Towards imperative modules: reasoning about invariants and sharing of mutable state ⋮ Observational purity and encapsulation ⋮ Formal verification of side-channel countermeasures using self-composition ⋮ Formalizing non-interference for a simple bytecode language in Coq ⋮ A certified lightweight non-interference Java bytecode verifier ⋮ Specification and static enforcement of scheduler-independent noninterference in a middleweight Java ⋮ Roles, stacks, histories: A triple for Hoare ⋮ Relational bytecode correlations ⋮ Relational Decomposition ⋮ Noninterference in a predicative polymorphic calculus for access control

Uses Software

• PVS

This page was built for publication: Stack-based access control and secure information flow