Game semantics for access control

From MaRDI portal
Publication:2805155

DOI10.1016/J.ENTCS.2009.07.088zbMATH Open1337.68157DBLPjournals/entcs/AbramskyJ09arXiv1401.5325OpenAlexW1965339206WikidataQ57006591 ScholiaQ57006591MaRDI QIDQ2805155FDOQ2805155


Authors: Samson Abramsky, Radha Jagadeesan Edit this on Wikidata


Publication date: 10 May 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

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 emph{non-interference theorems} in robust, semantic versions.


Full work available at URL: https://arxiv.org/abs/1401.5325




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Game semantics for access control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805155)