Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke  Home/Search
Context Related
| sunsite.informatik.rwth...200308.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sunsite.informatik.rwthaachen... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The dependency pair approach [2, 13, 14] is a powerful technique for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by well-founded orders. We improve the dependency pair approach by considerably reducing the number of constraints produced for (innermost) termination proofs. Moreover, we extend transformation techniques to manipulate dependency pairs which simplify (innermost)... (Update)
Cited by: More
Automated Termination Proofs with AProVE - Giesl, Thiemann, Schneider-Kamp, .. (2004) (Correct)
Improved Modular Termination Proofs Using Dependency Pairs - Thiemann, Giesl.. (2004) (Correct)
Similar documents (at the sentence level):
29.6%: Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003) (Correct)
Active bibliography (related documents): More All
0.6: Proving and Disproving Termination of Higher-Order.. - Giesl, Thiemann.. (2005) (Correct)
0.5: A Collection of Examples for Termination of Term Rewriting.. - Arts, Giesl (2001) (Correct)
0.5: Size-Change Termination for Term Rewriting - Giesl, Thiemann (2003) (Correct)
Similar documents based on text: More All
0.4: Deciding Inductive Validity of Equations - Giesl, Kapur (2003) (Correct)
Related documents from co-citation: More All
2: A collection of examples for termination of term rewriting using dependency pair.. - Arts, Giesl - 2001
2: Automatic termination proofs with transformation orderings (context) - Steinbach - 1995
2: TORPA: Termination of rewriting proved automatically (context) - Zantema - 2004
BibTeX entry: (Update)
J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Mechanizing dependency pairs. Technical Report AIB-2003-08 , RWTH Aachen, Germany, 2003. http://citeseer.ist.psu.edu/giesl03mechanizing.html More
@techreport{ gieslthiemannschneiderkampfalke03b,
author = "J\"urgen Giesl and Ren\'e Thiemann and Peter
Schneider-Kamp and Stephan Falke",
title = "Mechanizing Dependency Pairs",
institution = "RWTH Aachen",
year = "2003",
number = "AIB-2003-08",
month = december,
url =
"citeseer.ist.psu.edu/giesl03mechanizing.html",
url =
"http://aib.informatik.rwth-aachen.de/2003/2003-08.ps.gz" }
Citations (may not include all citations):384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
214 Orderings for term-rewriting systems (context) - Dershowitz - 1982
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
85 On proving term rewriting systems are Noetherian (context) - Lankford - 1979
83 Counterexamples to the termination for the direct sum of ter.. (context) - Toyama - 1987
82 Two generalizations of the recursive path ordering (context) - Kamin, Levy - 1980
68 Proofs by induction in equational theories with constructors (context) - Huet, Hullot - 1982
67 Termination of term rewriting using dependency pairs - Arts, Giesl - 2000
50 Simplification orderings: History of results (context) - Steinbach - 1995
49 Generating polynomial orderings for termination proofs - Giesl - 1995
47 Abstract relations between restricted termination and conflu.. (context) - Gramlich - 1995
30 Automatic termination proofs with transformation orderings (context) - Steinbach - 1995
25 The size-change principle for program termination - Lee, Jones et al. - 2001
25 Termination and Confluence Properties of Structured Rewrite .. (context) - Gramlich - 1996
19 On proving termination by innermost termination - Gramlich - 1996
18 Complete monotonic semantic path orderings - Borralleras, Ferreira et al. - 2000
17 Argument filtering transformation - Kusakari, Nakamura et al. - 1999
16 A general framework for automatic termination analysis of lo.. - Dershowitz, Lindenstrauss et al. - 2001
16 A collection of examples for termination of term rewriting u.. - Arts, Giesl - 2001
16 examples of termination - Dershowitz - 1995
13 Modular termination proofs for rewriting using dependency pa.. (context) - Giesl, Arts et al. - 2002
12 System description: The dependency pair method - Arts - 2000
11 Verification of Erlang processes by dependency pairs - Giesl, Arts - 2001
9 TALP: A tool for termination analysis of logic programs - Ohlebusch, Claves et al. - 2000
7 Automating the dependency pair method (context) - Hirokawa, Middeldorp - 2003
7 Tsukuba termination tool (context) - Hirokawa, Middeldorp - 2003
7 Size-change termination for term rewriting - Thiemann, Giesl - 2003
5 Improving dependency pairs - Giesl, Thiemann et al. - 2003
5 Cariboo: An induction based proof tool for termination with .. (context) - Fissore, Gnaedig et al. - 2002
5 Approximating dependency graphs using tree automata techniqu.. (context) - Middeldorp - 2083
4 Available from httpcime (context) - Monate, version et al. - 2000
4 Hierarchical termination revisited (context) - Ohlebusch - 2002
1 Approximating dependency graphs without using tree automata .. (context) - Hirokawa, Middeldorp - 2003
1 Approximations for strategies and termination (context) - Middeldorp - 2002
Documents on the same site (http://sunsite.informatik.rwth-aachen.de/Publications/AIB/2003/): More
Size-Change Termination for Term Rewriting - Thiemann, Giesl (2003) (Correct)
Solving the Sabotage Game is PSPACE-hard - Löding, Rohde (2003) (Correct)
Deciding Inductive Validity of Equations - Giesl, Kapur (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC