On the decidability of accessibility problems (extended abstract)

DOI10.1145/335305.335341zbMATH Open1296.68088OpenAlexW2075263851MaRDI QIDQ3191998FDOQ3191998

Authors: Rina Panigrahy, Vijay Saraswat, Suresh Ventkatasubramanian, Rajeev Motwani 

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335341

Recommendations

• Safety in grammatical protection systems
• On the decidability of the safety problem for access control policies
• On Complexity of Grammars Related to the Safety Problem
• On complexity of grammars related to the safety problem
• Decidability of safety in graph-based models for access control

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (10)

• On the decidability of the safety problem for access control policies
• Single semi-contextual insertion-deletion systems
• Rational subsets and submonoids of wreath products.
• Universal insertion grammars of size two
• On complexity of grammars related to the safety problem
• Safety analysis of the dynamic-typed access matrix model
• Nivat's processing systems: decision problems related to protection and synchronization
• Title not available (Why is that?)
• Creation and reflexive rights in grammatical protection systems
• The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates

This page was built for publication: On the decidability of accessibility problems (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191998)