Sciweavers

3 search results - page 1 / 1
» From Outermost Termination to Innermost Termination
Sort
View
90
Voted
SOFSEM
2009
Springer
15 years 9 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
ICTAC
2004
Springer
15 years 5 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...
106
Voted
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 10 days 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