Game Semantics for Access Control
From MaRDI portal
Publication:2805155
DOI10.1016/j.entcs.2009.07.088zbMath1337.68157arXiv1401.5325OpenAlexW1965339206WikidataQ57006591 ScholiaQ57006591MaRDI QIDQ2805155
Samson Abramsky, Radha Jagadeesan
Publication date: 10 May 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.5325
Applications of game theory (91A80) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Related Items
Games for Dependent Types, Game semantics for dependent types, Imperfect Information in Logic and Concurrent Games, Payoffs, Intensionality and Abstraction in Games, Noninterference in a predicative polymorphic calculus for access control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Notions of computation and monads
- Monad as modality
- Relating categorical semantics for intuitionistic linear logic
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Polarized games
- Full abstraction for nominal general references
- Variations in Access Control Logic
- Games and full completeness for multiplicative linear logic
- Payoffs, Intensionality and Abstraction in Games
- Foundations of Software Science and Computation Structures
- On-the-Fly Techniques for Game-Based Software Model Checking
- A Modal Deconstruction of Access Control Logics
- Access control in a core calculus of dependency
- Foundations of Software Science and Computational Structures
- Automata, Languages and Programming
- A Linear Logic of Authorization and Knowledge