A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
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...
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...
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...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...