Sciweavers

2273 search results - page 305 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
FROCOS
2007
Springer
15 years 4 months ago
Languages Modulo Normalization
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
Hitoshi Ohsaki, Hiroyuki Seki
FSR
2007
Springer
135views Robotics» more  FSR 2007»
15 years 4 months ago
State Space Sampling of Feasible Motions for High Performance Mobile Robot Navigation in Highly Constrained Environments
Sampling in the space of controls or actions is a well-established method for ensuring feasible local motion plans. However, as mobile robots advance in performance and competence ...
Thomas M. Howard, Colin J. Green, Alonzo Kelly
ICDT
2007
ACM
141views Database» more  ICDT 2007»
15 years 4 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
LFCS
2007
Springer
15 years 4 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
LPAR
2007
Springer
15 years 4 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...