Rewrite Systems Adam Koprowski and Hans Zantema Eindhoven University of...  Home/Search
Context
Related
| win.tue.nl/~akoprows/papers/slnat.ps 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: win.tue.nl/~akopro...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in combination with recursive path ordering (RPO). In order to do so we developed algorithms to... (Update)
Active bibliography (related documents): More All
0.4: TPA: Termination Proved Automatically - Adam Koprowski Technical (Correct)
0.4: Improved Modular Termination Proofs Using Dependency Pairs - Thiemann, Giesl.. (2004) (Correct)
0.3: Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ adam-recursive,
author = "Rewrite Systems Adam",
title = "Recursive Path Ordering for Infinite Labelled",
url = "citeseer.ist.psu.edu/745977.html" }
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
86 Termination of term rewriting by semantic labelling - Zantema - 1995
18 Proof of termination of the rewriting system SUBST on CCL (context) - Hardin, Laville - 1986
16 Termination of rewriting systems by polynomial interpretatio.. (context) - Cherifa, Lescanne - 1987
13 Strong normalization of substitutions (context) - Curien, Hardin et al. - 1992
6 Automated termination proofs with aprove - Giesl, Thiemann et al. - 2004
4 Torpa: Termination of rewriting proved automatically (context) - Zantema - 2004
3 volume 55 of Cambridge Tracts in TCS (context) - Zantema, Systems - 2003
http://www.lri.fr/
Documents on the same site (http://www.win.tue.nl/~akoprows/publications.html): More
Well-Foundedness of the Recursive Path Ordering in Coq - de Kleijn, Koprowski, van.. (2004) (Correct)
Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (Correct)
Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (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