|
195
|
Termination of Term Rewriting Using Dependency Pairs
– Thomas Arts, Jürgen Giesl
- 2000
|
|
105
|
On proving term rewriting systems are Noetherian", Memo MTP-3
– D S Lankford
- 1979
|
|
822
|
Term rewriting and All That
– F Baader, T Nipkow
- 1998
|
|
19
|
Cariboo: An induction based proof tool for termination with strategies
– O Fissore, I Gnaedig, H Kirchner
- 2002
|
|
45
|
Modular termination proofs for rewriting using dependency pairs
– J Giesl, T Arts, E Ohlebusch
|
|
47
|
Automated Termination Proofs with AProVE
– Jürgen Giesl, René Thiemann, Peter Schneider-kamp, Stephan Falke
- 2004
|
|
27
|
A Collection of Examples for Termination of Term Rewriting Using Dependency Pairs
– Thomas Arts, Jürgen Giesl
- 2001
|
|
16
|
Size-Change Termination for Term Rewriting
– René Thiemann, Jürgen Giesl
- 2003
|
|
54
|
Automating the dependency pair method
– Nao Hirokawa, Aart Middeldorp
- 2003
|
|
13
|
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
– Xavier Urbain
- 2001
|
|
431
|
Rewriting
– Nachum Dershowitz, David A. Plaisted
- 2001
|
|
47
|
Two generalizations of the recursive path ordering
– Sam Kamin, Jean-Jacques Levy
- 2005
|
|
37
|
Argument Filtering Transformation
– Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
- 1999
|
|
10
|
TORPA: Termination of rewriting proved automatically
– H Zantema
- 2004
|
|
17
|
Liveness in Rewriting
– Jürgen Giesl, Hans Zantema, Hans Zantema
- 2002
|
|
79
|
Termination of rewriting systems by polynomial interpretations and its implementation
– A Ben Cherifa, P Lescanne
|
|
253
|
Orderings for term-rewriting systems
– N Dershowitz
- 1982
|
|
18
|
Improving Dependency Pairs
– Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
- 2003
|
|
18
|
System Description: The Dependency Pair Method
– Thomas Arts
- 2000
|
