Sciweavers

30 search results - page 6 / 6
» Event-Clock Visibly Pushdown Automata
Sort
View
FSTTCS
2008
Springer
13 years 8 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
MFCS
2009
Springer
14 years 2 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan
LATIN
2010
Springer
14 years 2 months ago
The Language Theory of Bounded Context-Switching
Concurrent compositions of recursive programs with ļ¬nite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 8 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
ECOOP
2007
Springer
14 years 1 months ago
Towards correct evolution of components using VPA-based aspects
Abstract. Interaction protocols are a popular means to construct correct component-based systems. Aspects that modify such protocols are interesting in this context because they su...
Dong Ha Nguyen, Mario Südholt