On the decidability of accessibility problems (extended abstract)

Authors:
Rajeev Motwani;Rina Panigrahy;Vijay Saraswat;Suresh Ventkatasubramanian
Affiliations:
Department of Computer Science, Stanford University;Cisco Systems, San Jose, CA;AT&T Shannon Laboratory, 180 Park Ave, Florham Park, NJ;AT&T Shannon Laboratory, 180 Park Ave, Florham Park, NJ
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

The schematic protection model: its definition and analysis for acyclic attenuating schemes

Journal of the ACM (JACM)
A Linear Time Algorithm for Deciding Subject Security

Journal of the ACM (JACM)
Protection in operating systems

Communications of the ACM
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Compliance Checking in the PolicyMaker Trust Management System

FC '98 Proceedings of the Second International Conference on Financial Cryptography
The Typed Access Matrix Model

SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Decentralized Trust Management

SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy

Safety analysis of usage control authorization models

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
On complexity of grammars related to the safety problem

Theoretical Computer Science
Leftist Grammars Are Non-primitive Recursive

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Automatic error finding in access-control policies

Proceedings of the 18th ACM conference on Computer and communications security
On complexity of grammars related to the safety problem

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Leftist grammars and the chomsky hierarchy

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Toward a compositional theory of leftist grammars and transformations

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Mohawk: Abstraction-Refinement and Bound-Estimation for Verifying Access Control Policies

ACM Transactions on Information and System Security (TISSEC)
Rational subsets and submonoids of wreath products

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Hi-index	0.01