Skip to main content
Springer Nature Link
Log in

On Complexity of Grammars Related to the Safety Problem

  • Conference paper
Automata, Languages and Programming (ICALP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4052))

Included in the following conference series:

  • 6294 Accesses

Abstract

Leftist grammars were introduced by Motwani et. al., who established the relationship between the complexity of accessibility problem (or safety problem) for certain general protection system and the membership problem of these grammars. The membership problem for leftist grammars is decidable. This implies the decidability of the accessibility problem. It is shown that the membership problem for leftist grammars is PSPACE-hard. Therefore, the accessibility problem in the appropriate protection systems is PSPACE-hard as well. Furthermore, the PSPACE-hardness result is adopted to very restricted class of leftist grammars, if the grammar is a part of the input.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bandyopadhyay, S., Mahajan, M., Kumar, K.N.: A non-regular leftist language. Manuscript (2005)

    Google Scholar 

  2. Blaze, M., Feigenbaum, J., Ioannidis, J., Keromytis, A.: The role of trust management in distributed security. In: Vitek, J. (ed.) Secure Internet Programming. LNCS, vol. 1603, pp. 185–210. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Budd, T.: Safety in grammatical protection systems. International Journal of Computer and Information Sciences 12(6), 413–430 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cheiner, O., Saraswat, V.: Security Analysis of Matrix. Technical report, AT&T Shannon Laboratory (1999)

    Google Scholar 

  5. Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)

    MATH  Google Scholar 

  6. Harrison, M., Ruzzo, W., Ullman, J.: Protection in operating systems. Communications of the ACM 19(8), 461–470 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  7. Jurdziński, T., Loryś, K.: Leftist Grammars and the Chomsky Hierarchy. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 293–304. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Lipton, R., Snyder, L.: A linear time algorithm for deciding subject security. Journal of the ACM 24(3), 455–464 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  9. Motwani, R., Panigrahy, R., Saraswat, V.A., Venkatasubramanian, S.: On the decidability of accessibility problems (extended abstract). STOC, 306–315 (2000)

    Google Scholar 

  10. Saraswat, V.: The Matrix Design. Technical report, AT&T Laboratory (April 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Wrocław University, Przesmyckiego 20, 51151, Wrocław, Poland

    Tomasz Jurdziński

Authors
  1. Tomasz Jurdziński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    Michele Bugliesi

  2. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  3. ECS, University of Southampton, UK

    Vladimiro Sassone

  4. FB Informatik, LS2, Univ. Dortmund, 44221, Dortmund, Germany

    Ingo Wegener

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jurdziński, T. (2006). On Complexity of Grammars Related to the Safety Problem. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_37

Download citation

  • DOI: https://doi.org/10.1007/11787006_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35907-4

  • Online ISBN: 978-3-540-35908-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics