XACML 3.0 in Answer Set Programming

Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming Nielson

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

We present a systematic technique for transforming XACML 3.0 policies in Answer Set Programming (ASP). We show that the resulting logic program has a unique answer set that directly corresponds to our formalisation of the standard semantics of XACML 3.0 from [9]. We demonstrate how our results make it possible to use off-the-shelf ASP solvers to formally verify properties of access control policies represented in XACML, such as checking the completeness of a set of access control policies and verifying policy properties.
Original languageEnglish
Title of host publicationLogic-Based Program Synthesis and Transformation : 22nd International Symposium, LOPSTR 2012, Leuven, Belgium, September 18-20, 2012, Revised Selected Papers
PublisherSpringer
Publication date2013
Pages89-105
ISBN (Print)978-3-642-38196-6
ISBN (Electronic)978-3-642-38197-3
DOIs
Publication statusPublished - 2013
Event22nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012) - Leuven, Belgium
Duration: 18 Sep 201220 Sep 2012

Conference

Conference22nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012)
CountryBelgium
CityLeuven
Period18/09/201220/09/2012
SeriesLecture Notes in Computer Science
Volume7844
ISSN0302-9743

Keywords

  • XACML
  • Access control
  • Policy language
  • Answer Set Programming

Fingerprint Dive into the research topics of 'XACML 3.0 in Answer Set Programming'. Together they form a unique fingerprint.

Cite this