Reasoning about the consequences of authorization policies in a linear epistemic logic (2009)
Cached
Download Links
| Citations: | 9 - 3 self |
BibTeX
@TECHREPORT{DeYoung09reasoningabout,
author = {Henry DeYoung and Frank Pfenning},
title = { Reasoning about the consequences of authorization policies in a linear epistemic logic},
institution = {},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Authorization policies are not stand-alone objects: they are used to selectively permit actions that change the state of a system. Thus, it is desirable to have a framework for reasoning about the semantic consequences of policies. To this end, we extend a rewriting interpretation of linear logic with connectives for modeling affirmation, knowledge, and possession. To cleanly confine semantic effects to the rewrite sequence, we introduce a monad. The result is a richly expressive logic that elegantly integrates policies and their effects. After presenting this logic and its metatheory, we demonstrate its utility by proving properties that relate a simple file system’s policies to their semantic consequences.
