Thomas Arts, Jürgen Giesl  Home/Search
Context Related
| cs.ruu.nl/pub/RUU/CS/te...199644.ps.gz archive.cs.uu.nl/pub/RU...199644.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: kirmes.inferenzsysteme.informa... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: To prove termination of term rewriting systems (TRSs), several methods have been developed to synthesize suitable well-founded orderings automatically. However, virtually all orderings that are amenable to automation are so-called simplification orderings. Unfortunately, there exist numerous interesting and relevant TRSs that cannot be oriented by orderings of this restricted class and therefore their termination cannot be proved automatically with the existing techniques. In this paper we... (Update)
Similar documents based on text: More All
0.6: Termination of Constructor Systems - Arts, Giesl (1996) (Correct)
0.4: Pushing the Frontiers of Combining Rewrite Systems Farther.. - Giesl, Ohlebusch (1998) (Correct)
0.3: Proving Innermost Normalisation Automatically - Arts, Giesl (1997) (Correct)
Related documents from co-citation: More All
19: Termination of term rewriting using dependency pairs - Arts, Giesl - 1997
18: Proving innermost normalisation automatically - Arts, Giesl - 1997
16: Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
BibTeX entry: (Update)
T. Arts & J. Giesl, Automatically proving termination where simplification orderings fail. In Proc. TAPSOFT '97, LNCS 1214, Lille, France, 1997. http://citeseer.ist.psu.edu/arts97automatically.html More
@inproceedings{ arts97automatically,
author = "Arts and Giesl",
title = "Automatically Proving Termination Where Simplification Orderings Fail",
booktitle = "{TAPSOFT}: 7th International Joint Conference on Theory and Practice of Software Development",
year = "1997",
url = "citeseer.ist.psu.edu/arts97automatically.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
392 A Computational Logic (context) - Boyer, Moore - 1979
384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
214 Orderings for term-rewriting systems (context) - Dershowitz - 1982
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
89 Termination of term rewriting: interpretation and type elimi.. - Zantema - 1994
86 Termination of term rewriting by semantic labelling - Zantema - 1995
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
65 the uniform halting problem for term rewriting systems (context) - Huet, Lankford - 1978
58 Termination of rewriting systems by polynomial interpretatio.. (context) - Cherifa, Lescanne - 1987
56 Information Processing Letters - Dershowitz, on et al. - 1979
53 Theoretical Computer Science (context) - Dershowitz, Hoot - 1995
50 Simplification orderings: history of results (context) - Steinbach - 1995
49 Generating polynomial orderings for termination proofs - Giesl - 1995
43 Termination of nested and mutually recursive algorithms - Giesl - 1996
41 On proving the termination of algorithms by machine (context) - Walther - 1994
32 Dummy elimination: making termination easier - Ferreira, Zantema - 1995
32 Applicable Algebra in Engineering (context) - Bellegarde, Lescanne et al. - 1990
32 Generating polynomial orderings (context) - Steinbach - 1994
31 Total termination of term rewriting (context) - Ferreira, Zantema - 1993
31 Modular proofs for completeness of hierarchical term rewriti.. (context) - Rao - 1995
30 Proving innermost normalisation automatically - Arts, Giesl - 1996
30 Automatic termination proofs with transformation orderings (context) - Steinbach - 1995
26 Termination of linear rewriting systems (context) - Dershowitz - 1981
21 Automatisierung von Terminierungsbeweisen fur rekursiv defin.. (context) - Giesl - 1995
19 Termination of constructor systems - Arts, Giesl - 1996
19 Termination of constructor systems - Arts, Giesl - 1996
19 A recursively defined ordering for proving termination of te.. (context) - Plaisted - 1978
19 Automating the Knuth Bendix ordering (context) - Dick, Kalmus et al. - 1990
19 transformation and termination (context) - Bachmair, Dershowitz - 1986
16 examples of termination - Dershowitz - 1993
15 Termination by absence of infinite chains of dependency pair.. - Arts - 1996
15 Automatisierung von Terminierungsbeweisen (context) - Walther - 1991
13 Proving termination (context) - Bevers, Lewi - 1993
12 Overlap closures and termination of term rewriting systems (context) - Geupel - 1989
9 A finite termination criterion (context) - Lankford, Musser - 1978
7 Notes on transformation orderings - Steinbach - 1992
6 Termination of term rewriting systems (context) - Geerling - 1991
5 Totality and Transformations (context) - Ferreira, Term et al. - 1995
4 Termination proofs based on transformation techniques (context) - Bellegarde, Lescanne - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://kirmes.inferenzsysteme.informatik.th-darmstadt.de/~giesl/): More
Termination of Constructor Systems - Arts, Giesl (1996) (Correct)
Modularity of Termination Using Dependency Pairs - Arts, Giesl (1997) (Correct)
Termination Analysis for Functional Programs using Term Orderings - Giesl (1995) (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