TPA : termination proved automatically

A. Koprowski

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

    14 Citations (Scopus)

    Abstract

    TPA is a tool for proving termination of term rewrite systems (TRSs) in a fully automated fashion. The distinctive feature of TPA is the support for relative termination and the use of the technique of semantic labelling with natural numbers. Thanks to the latter, TPA is capable of delivering automated termination proofs for some difficult TRSs for which all other tools fail.
    Original languageEnglish
    Title of host publicationRewriting Techniques and Applications (Proceedings 17th International Conference, RTA 2006, Seattle WA, USA, August 12-14, 2006)
    EditorsF. Pfenning
    Place of PublicationBerlin
    PublisherSpringer
    Pages257-266
    ISBN (Print)3-540-36834-5
    DOIs
    Publication statusPublished - 2006

    Publication series

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

    Fingerprint

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

    Cite this