On the decidability of the safety problem for access control policies
DOI10.1016/J.ENTCS.2007.05.032zbMATH Open1335.68141OpenAlexW1995511026MaRDI QIDQ5178997FDOQ5178997
Authors: E. Kleiner, Tom Newcomb
Publication date: 18 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.032
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
Cited In (17)
- Specifying and Reasoning About Dynamic Access-Control Policies
- Title not available (Why is that?)
- Information Security
- Computational complexity of the problem of tree generation under fine-grained access control policies
- Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
- Verification and enforcement of access control policies
- Trustworthy Global Computing
- On the decidability of accessibility problems (extended abstract)
- A logic of access control
- A logic of access control
- Time dependent policy-based access control
- Decidability of safety in graph-based models for access control
- Information Security
- Specification and verification of access control policies in EB\(^{3}\)SEC: work in progress
- Analysis of schemas with access restrictions
- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
- A multivariate approach for checking resiliency in access control
Uses Software
This page was built for publication: On the decidability of the safety problem for access control policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178997)