A Grammatical Representation of Visibly Pushdown Languages

Baran, Joachim and Barringer, Howard (2007) A Grammatical Representation of Visibly Pushdown Languages. Lecture Notes in Computer Science, 4576. pp. 1-11. ISSN 978-3-540-73443-7

[img] PDF

Download (244kB)
Official URL: http://www.springerlink.com/content/c723r1251w7565...


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.

Item Type: Article
Uncontrolled Keywords: CICADA
Subjects: MSC 2010, the AMS's Mathematics Subject Classification > 68 Computer science
Depositing User: Dr Margarita Korovina
Date Deposited: 13 Jun 2010
Last Modified: 20 Oct 2017 14:12
URI: http://eprints.maths.manchester.ac.uk/id/eprint/1475

Actions (login required)

View Item View Item