234 search results - page 20 / 47 » On Quasi-Products of Tree Automata |
105
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
118
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
136
click to vote
RTA
2005
Springer
15 years 6 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
PODS
2004
ACM
16 years 1 months ago
2004
ACM
CAI
2009
Springer
15 years 8 months ago
2009
Springer