TORPA : termination of rewriting proved automatically

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

15 Citations (Scopus)
2 Downloads (Pure)

Abstract

The tool TORPA (Termination of Rewriting Proved Automatically) can be used to prove termination of string rewriting systems (SRSs) fully automatically. The underlying techniques include semantic labelling, polynomial interpretations, recursive path order, the dependency pair method and match bounds of right hand sides of forward closures.
Original languageEnglish
Title of host publicationRewriting techniques and applications : proceedings 15th international conference, RTA 2004, Aachen, Germany, June 3-5, 2004
EditorsV. Oostrom, van
Place of PublicationBerlin
PublisherSpringer
Pages95-104
ISBN (Print)3-540-22153-0
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
Volume3091
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'TORPA : termination of rewriting proved automatically'. Together they form a unique fingerprint.

Cite this