Sciweavers

4 search results - page 1 / 1
» Proving Innermost Normalisation Automatically
Sort
View
RTA
1997
Springer
14 years 2 months ago
Proving Innermost Normalisation Automatically
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
Thomas Arts, Jürgen Giesl
CADE
2007
Springer
14 years 4 months ago
Proving Termination by Bounded Increase
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
Jürgen Giesl, René Thiemann, Stephan S...
ICTAC
2004
Springer
14 years 3 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 10 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl