A Grammatical Representation of Visibly Pushdown Languages

  • Joachim Baran
  • Howard Barringer
Conference paper

DOI: 10.1007/978-3-540-73445-1_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4576)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Joachim Baran
    • 1
  • Howard Barringer
    • 1
  1. 1.The University of Manchester, School of Computer Science, ManchesterUK

Personalised recommendations