Reference : Modal Access Control Logic - Axiomatization, Semantics and FOl Theorem Proving
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/24952
Modal Access Control Logic - Axiomatization, Semantics and FOl Theorem Proving
English
Genovese, Valerio [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Rispoli, Daniele [> >]
Gabbay, Dov M. [> >]
van der Torre, Leon mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2010
STAIRS 2010
114-126
Yes
International
STAIRS 2010
16-20 August
Lisbon
Portugal
[en] Axiomatization ; FOL Theorem Proving ; Semantics
[en] We present and study a Modal Access Control Logic (M-ACL) to specify and reason about access control policies. We identify canonical properties of well-known access control axioms. We provide a Hilbert-style proof-system and we prove soundness, completeness and decidability of the logic. We present a sound and complete embedding of Modal Access Control Logic into First-Order Logic. We show how to use SPASS theorem prover to reason about access control policies expressed as formulas of Modal Access Control Logic, and we compare our logic with existing ones.
Researchers ; Professionals ; Students ; General public ; Others
http://hdl.handle.net/10993/24952
10.3233/978-1-60750-676-8-114
http://ebooks.iospress.nl/publication/6262

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
blank.pdfPublisher postprint10.85 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.