218 search results - page 27 / 44 » Finite Trees as Ordinals |
110
click to vote
ACL
1990
14 years 11 months ago
1990
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
PODS
2005
ACM
15 years 10 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
109
click to vote
CONCUR
2006
Springer
14 years 12 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
FORTE
2008
14 years 11 months ago
2008
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...