76 search results - page 10 / 16 » Weak Alternating Automata and Tree Automata Emptiness |
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
ACTA
2010
13 years 7 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...