Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be embedded in simple type theory and we have demonstrated that the higher-order theorem prover LEO-II can automate reasoning in and about them. In this paper we combine these results and describe a sound (and complete) embedding of different access control logics in simple type theory. Employing this framework we show that the off the shelf theorem prover LEO-II can be applied to automate reasoning in and about prominent access control logics. © IFIP International Federation for Information Processing 2009.
CITATION STYLE
Benzmüller, C. (2009). Automating access control logics in simple type theory with LEO-II. In IFIP Advances in Information and Communication Technology (Vol. 297, pp. 387–398). Springer New York LLC. https://doi.org/10.1007/978-3-642-01244-0_34
Mendeley helps you to discover research relevant for your work.