On complexity of grammars related to the safety problem

Theoretical Computer Science

Volumn 389, Issue 1-2, 2007, Pages 56-72

  Jurdziński, Tomasz ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Accessibility problem; Automata and formal languages; Leftist grammars; Protection system

Indexed keywords

AUTOMATA THEORY; FORMAL LANGUAGES; PROBLEM SOLVING;

ACCESSIBILITY PROBLEMS; GRAMMARS; LEFTIST GRAMMARS; PROTECTION SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 36048950692     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.043     Document Type: Article

References (19)

1. S. Bandyopadhyay, M. Mahajan, K.N. Kumar, A non-regular leftist language, Manuscript, 2005
2. Blaze M., Feigenbaum J., Ioannidis J., and Keromytis A. The role of trust management in distributed security. Proc. Editors, Secure Internet Programming: Security Issues for Distributed and Mobile Objects. LNCS vol. 1603 (1999), Springer 185-210
3. Budd T. Safety in grammatical protection systems. International Journal of Computer and Information Sciences 12 6 (1983) 413-430
4. O. Cheiner, V. Saraswat, Security Analysis of Matrix, Technical Report, AT&T Shannon Laboratory, 1999
5. Harrison M. Introduction to Formal Language Theory (1978), Addison-Wesley
6. Harrison M., Ruzzo W., and Ullman J. Protection in operating systems. Communications of the ACM 19 8 (1976) 461-470
7. Hopcroft J., Motwani R., and Ullman J. Introduction to Automata Theory, Languages, and Computation (2000), Addison-Wesley
8. Jurdziński T., and Loryś K. Leftist grammars and the Chomsky hierarchy. 15th International Symposium Fundamentals of Computation Theory. FCT 2005. LNCS vol. 3623 (2005) 282-293
9. Jurdziński T., and Loryś K. Leftist grammars and the Chomsky hierarchy. Theory of Computing Systems 41 (2007) 233-256 Full version of~[8]
10. Lothaire M. Combinatorics on Words (1983), Addison-Wesley
11. Li N., and Tripunitara M.V. On safety in discretionary access control. Proc. IEEE Symposium on Security and Privacy (2005), IEEE Press
12. Lipton R., and Budd T. On classes of protection systems. Foundations of Secure Computation (1978), Academic Press 281-296
13. Lipton R., and Snyder L. A linear time algorithm for deciding subject security. Journal of the ACM 24 3 (1977) 455-464
14. R. Motwani, R. Panigrahy, V.A. Saraswat, S. Venkatasubramanian, On the decidability of accessibility problems (extended abstract), in: STOC 2000, pp. 306-315
15. Ravi S. Sandhu, The typed access matrix model, in: Proceedings IEEE Computer Society Symposium on Research in Security and Privacy, May 1992, pp. 122-136
16. V. Saraswat, The Matrix Design, Technical Report, AT&T Laboratory, April 1997
17. V. Saraswat, R. Jagadeesan, Static support for capability-based programming in Java, Manuscript
18. Soshi M., Maekawa M., and Okamoto E. The dynamic-typed access matrix model and decidability of the safety problem. IEICE Transactions on Fundamentals E87-A 1 (2004) 190-203
19. Wagner K., and Wechsung G. Computational Complexity (1986), Deutscher Verlag der Wissenschaften, Berlin