Sciweavers

1705 search results - page 6 / 341
» Representing Constraints with Automata
Sort
View
ACTA
2010
191views more  ACTA 2010»
13 years 7 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
AMW
2011
12 years 11 months ago
A Direct Translation from XPath to Nondeterministic Automata
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
Nadime Francis, Claire David, Leonid Libkin
IRI
2008
IEEE
14 years 2 months ago
Modeling and synthesis of service composition using tree automata
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
Ken Q. Pu, Ying Zhu
KDID
2004
132views Database» more  KDID 2004»
13 years 9 months ago
An Automata Approach to Pattern Collections
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
AAAI
2006
13 years 9 months ago
Representing Systems with Hidden State
We discuss the problem of finding a good state representation in stochastic systems with observations. We develop a duality theory that generalizes existing work in predictive sta...
Christopher Hundt, Prakash Panangaden, Joelle Pine...