On the decidability of the safety problem for access control policies
From MaRDI portal
Publication:5178997
Recommendations
Cites work
Cited in
(17)- Specifying and Reasoning About Dynamic Access-Control Policies
- scientific article; zbMATH DE number 1980974 (Why is no real title available?)
- Computational complexity of the problem of tree generation under fine-grained access control policies
- Information Security
- 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
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)