Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
424056 | Electronic Notes in Theoretical Computer Science | 2009 | 22 Pages |
Abstract
We introduce a semantic approach to the study of logics for access control and dependency analysis, based on Game Semantics. We use a variant of AJM games with explicit justification (but without pointers). Based on this, we give a simple and intuitive model of the information flow constraints underlying access control. This is used to give strikingly simple proofs of non-interference theorems in robust, semantic versions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics