On the decidability of the safety problem for access control policies
From MaRDI portal
(Redirected from On the decidability of the safety problem for access control policies)
Recommendations
Cites work
Cited in
(17)- Automata model for verifying attibuted-based access control policy in systems with a finite number of objects
- Verification and enforcement of access control policies
- A multivariate approach for checking resiliency in access control
- Specification and verification of access control policies in EB\(^{3}\)SEC: work in progress
- On the decidability of accessibility problems (extended abstract)
- Specifying and Reasoning About Dynamic Access-Control Policies
- The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
- scientific article; zbMATH DE number 1980974 (Why is no real title available?)
- Analysis of schemas with access restrictions
- Decidability of safety in graph-based models for access control
- Trustworthy Global Computing
- Information Security
- Information Security
- Computational complexity of the problem of tree generation under fine-grained access control policies
- A logic of access control
- A logic of access control
- Time dependent policy-based 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)