Skip to main content
Springer Nature Link
Log in

A Grammatical Representation of Visibly Pushdown Languages

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2007)

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

  • 756 Accesses

Abstract

Model-checking regular properties is well established and a powerful verification technique for regular as well as context-free program behaviours. Recently, through the use of ω-visibly pushdown languages (ωVPLs), defined by ω-visibly pushdown automata, model-checking of properties beyond regular expressiveness was made possible and shown to be still decidable even when the program’s model of behaviour is an ωVPL. In this paper, we give a grammatical representation of ωVPLs and the corresponding finite word languages – VPL. From a specification viewpoint, the grammatical representation provides a more natural representation than the automata approach.

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. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 202–211. ACM Press, New York (2004)

    Chapter  Google Scholar 

  2. Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1–13. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Berstel, J., Boasson, L.: Balanced grammars and their languages. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, pp. 3–25. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Engelfriet, J.: An elementary proof of double Greibach normal form. Information Processing Letters 44(6), 291–293 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  6. Löding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 408–420. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Manchester, School of Computer Science, Manchester, UK

    Joachim Baran & Howard Barringer

Authors
  1. Joachim Baran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Howard Barringer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Daniel Leivant Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Baran, J., Barringer, H. (2007). A Grammatical Representation of Visibly Pushdown Languages. In: Leivant, D., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2007. Lecture Notes in Computer Science, vol 4576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73445-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73445-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73443-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics