A Grammatical Characterisation of Visibly Pushdown Languages
نویسندگان
چکیده
Model-checking regular properties has been proven to be a useful verification technique for regular as well as context-free programs. Only recently, model-checking was extended by ω-visibly pushdown languages (ωVPLs) beyond verifying regular properties and shown to be still decidable when the program is an ωVPL too. In this paper, we give a grammatical characterisation of ωVPLs and the corresponding finite word languages – VPL. For particular specification problems, the grammatical characterisation provides a more succinct representation than the automata approach.
منابع مشابه
A Grammatical Representation of Visibly Pushdown Languages
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 ...
متن کاملVisibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is given by a visibly pushdown language. We establish that, unlike pushdown games with pushdown winning conditio...
متن کاملOn the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages. The complexity of their membership problem is equivalent to that of regular languages. However, the corresponding counting problem – computing the number of accepting paths in a visibly pushdown automaton – could be harder than counting paths in a non-deterministi...
متن کاملOn the Expressive Power of 2-Stack Visibly Pushdown Automata
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La Torre, Madhusudan, and Parlato, who exploit the concept of visibility further to obtain a rich pushdown-automata cla...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò
Visibly pushdown automata have been recently introduced by Alur and Madhusudan as a subclass of pushdown automata. This class enjoys nice properties such as closure under all Boolean operations and the decidability of language inclusion. Along the same line, we introduce here visibly pushdown transducers as a subclass of pushdown transducers. We study properties of those transducers and identif...
متن کامل