用LEO- II实现简单类型论中访问控制逻辑的自动化
Automating Access Control Logics in Simple Type Theory with LEO-II
摘要：
Garg和Abadi最近证明了著名的访问控制逻辑可以以一种合理和完整的方式转换为模态逻辑S4。我们之前已经概述了正常的多模态逻辑，包括单峰逻辑K和S4，可以嵌入简单的类型论（也称为高阶逻辑），我们已经证明了高阶定理证明器LEO-II可以自动推理。在本文中，我们结合这些结果，并描述了一个声音和完整的嵌入不同的访问控制逻辑在简单的类型论。采用这个框架，我们表明，现成的定理证明LEO-II可以应用于自动推理突出的访问控制逻辑。
英文摘要：
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 (which is also known as higher-order logic) 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 prominent access control logics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
