XACML 3.0 in answer set programming

DOI10.1007/978-3-642-38197-3_7MaRDI QIDQ2848900zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Full work available at URL https://arxiv.org/abs/1206.5327

zbMATH Keywords

access controlanswer set programmingpolicy languageXACML

Mathematics Subject Classification ID

Logic programming (68N17)

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.

Recommendations

• Logical approaches to authorization policies
• Model Checking Abstract State Machines with Answer Set Programming
• PTaCL: a language for attribute-based access control in open systems
• Modal access control logic. Axiomatization, semantics and FOL theorem proving
• Reasoning about delegation and revocation schemes in answer set programming

Cited in

(1)

• A contract language for service-oriented dynamic collaborations

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)