18 search results - page 3 / 4 » FO Model Checking on Nested Pushdown Trees |
POPL
2006
ACM
14 years 6 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...
CORR
2011
Springer
13 years 24 days ago
2011
Springer
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
STACS
2010
Springer
14 years 23 days ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
ICOODB
2009
13 years 3 months ago
2009
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...