5 search results - page 1 / 1 » Visibly Tree Automata with Memory and Constraints |
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
Tree automata with one memory have been introduced in
CORR
2008
Springer
13 years 5 months ago
2008
Springer
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
ACTA
2010
13 years 5 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...
IANDC
2011
13 years 9 days ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...