15 search results - page 3 / 3 » Properties of Visibly Pushdown Transducers |
234
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
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...
123
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
123
Voted
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
121
Voted
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
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...