Sciweavers

1000 search results - page 17 / 200
» Dependency Tree Automata
Sort
View
ACTA
2010
191views more  ACTA 2010»
13 years 9 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
ACL
2004
13 years 11 months ago
Dependency Tree Kernels for Relation Extraction
We extend previous work on tree kernels to estimate the similarity between the dependency trees of sentences. Using this kernel within a Support Vector Machine, we detect and clas...
Aron Culotta, Jeffrey S. Sorensen
FSTTCS
2006
Springer
14 years 1 months ago
Branching Pushdown Tree Automata
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
Rajeev Alur, Swarat Chaudhuri
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
BIRTHDAY
2008
Springer
13 years 11 months ago
History Dependent Automata for Service Compatibility
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...