A Grammatical Representation of Visibly Pushdown Languages
- 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
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.
Unable to display preview. Download preview PDF.