A grammatical representation of visibly pushdown languages

Authors:
Joachim Baran;Howard Barringer
Affiliations:
The University of Manchester, School of Computer Science, Manchester, UK;The University of Manchester, School of Computer Science, Manchester, UK
Venue:
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Year:
2007

Citing 6
Cited 0

An elementary proof of double Greibach normal form

Information Processing Letters
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Balanced grammars and their languages

Formal and natural computing
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Visibly pushdown games

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

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.