XACML 3.0 in Answer Set Programming
From MaRDI portal
Publication:2848900
DOI10.1007/978-3-642-38197-3_7zbMATH Open1395.68084DBLPconf/lopstr/RamliNN12arXiv1206.5327OpenAlexW2135273171WikidataQ51540670 ScholiaQ51540670MaRDI QIDQ2848900FDOQ2848900
Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming Nielson
Publication date: 13 September 2013
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
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 Ramli et. al. 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.
Full work available at URL: https://arxiv.org/abs/1206.5327
Cited In (1)
This page was built for publication: XACML 3.0 in Answer Set Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848900)
