TORPA : termination of rewriting proved automatically
| Autor: | Zantema, H., Oostrom, van, V. |
|---|---|
| Přispěvatelé: | Formal System Analysis |
| Jazyk: | angličtina |
| Rok vydání: | 2004 |
| Předmět: |
Polynomial
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Dependency (UML) Semantics (computer science) TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Confluence String (computer science) Path (graph theory) Computer Science::Programming Languages Rewriting Proof obligation Algorithm Mathematics |
| Zdroj: | Rewriting Techniques and Applications ISBN: 9783540221531 RTA Rewriting techniques and applications : proceedings 15th international conference, RTA 2004, Aachen, Germany, June 3-5, 2004, 95-104 STARTPAGE=95;ENDPAGE=104;TITLE=Rewriting techniques and applications : proceedings 15th international conference, RTA 2004, Aachen, Germany, June 3-5, 2004 |
| DOI: | 10.1007/978-3-540-25979-4_7 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|