TY  - JOUR
N1  - This is a pre-copyedited, author-produced PDF of an article accepted for publication in the Journal of Logic and Computation following peer review. The version of record, Pym, D; Collinson, M; McDonald, K; (2015) Layered graph logic as an assertion language for access control policy models. Journal of Logic and Computation, is available online at: http://dx.doi.org/10.1093/logcom/exv020.
IS  - 1
SP  - 41
VL  - 27
A1  - Pym, D
A1  - Collinson, M
A1  - McDonald, K
JF  - Journal of Logic and Computation
SN  - 1465-363X
UR  - http://dx.doi.org/10.1093/logcom/exv020
EP  - 80
AV  - public
Y1  - 2015/06/12/
TI  - Layered graph logic as an assertion language for access control policy models
KW  - substructural logic
KW  -  layered graphs
KW  -  access control
KW  -  modelling
PB  - Oxford University Press (OUP)
ID  - discovery1464201
N2  - We describe a uniform logical framework, based on a bunched logic that combines classical additives and very weak multiplicatives, for reasoning compositionally about access control policy models. We show how our approach takes account of the underlying system architecture, and so provides a way to identify and reason about how vulnerabilities may arise (and be removed) as a result of the architecture of the system. We consider, using frame rules, how local properties of access control policies are maintained as the system architecture evolves.
ER  -