Sciweavers

21 search results - page 4 / 5
» Automata and Logics for Words and Trees over an Infinite Alp...
Sort
View
CAV
2004
Springer
152views Hardware» more  CAV 2004»
13 years 10 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
ENTCS
2002
103views more  ENTCS 2002»
13 years 4 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
PODS
2009
ACM
122views Database» more  PODS 2009»
14 years 5 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
CONCUR
2006
Springer
13 years 8 months ago
Controller Synthesis for MTL Specifications
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier
ESOP
2008
Springer
13 years 6 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
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...
C.-H. Luke Ong