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
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
Applications of game theory (91A80) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cites Work
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- Notions of computation and monads
- Monad as modality
- Title not available (Why is that?)
- Polarized games
- Full abstraction for nominal general references
- Games and full completeness for multiplicative linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Linear Logic of Authorization and Knowledge
- Foundations of Software Science and Computation Structures
- Title not available (Why is that?)
- Foundations of Software Science and Computational Structures
- Title not available (Why is that?)
- A Modal Deconstruction of Access Control Logics
- Title not available (Why is that?)
- Relating categorical semantics for intuitionistic linear logic
- Title not available (Why is that?)
- Variations in Access Control Logic
- Payoffs, Intensionality and Abstraction in Games
- On-the-Fly Techniques for Game-Based Software Model Checking
- Access control in a core calculus of dependency
- Automata, Languages and Programming
Cited In (7)
- Game semantics for dependent types
- Disentangling parallelism and interference in game semantics
- Noninterference in a predicative polymorphic calculus for access control
- Games for Dependent Types
- Imperfect Information in Logic and Concurrent Games
- Payoffs, Intensionality and Abstraction in Games
- Axiomatizations of Banzhaf permission values for games with a permission structure
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)