Toggle Main Menu Toggle Search

Open Access padlockePrints

Reasoning about XACML policies using CSP

Lookup NU author(s): Dr Jeremy Bryans


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


In this work we explore the use of process algebra in formalising and analysing access control policies. We do this by considering a standard access control language (XACML) and show how the core concepts in the language can be represented in CSP. We then show how properties of these policies may also be described in CSP, and how model checking may be used to verify that a policy meets the property. We further consider how we may introduce a notion of workflow into this framework, and show that a simple appreciation of the workflow context may limit the things we need to verify about a policy. Copyright 2005 ACM.

Publication metadata

Author(s): Bryans J

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Proceedings of the ACM Conference on Computer and Communications Security

Year of Conference: 2005

Pages: 28-35

Publisher: ACM Press


DOI: 10.1145/1103022.1103028

Library holdings: Search Newcastle University Library for this item

ISBN: 1595932348