Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

RTA
2005
Springer

favoriteEmaildiscussreport

137views Theoretical Computer Science» more RTA 2005»

Orderings for Innermost Termination

13 years 10 months ago

Orderings for Innermost Termination

Download www.lsi.upc.edu

Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This property may lead to several innermost-speciﬁc orderings. Here, an IP-monotonic version of the Recursive Path Ordering is presented. This variant can be used (directly or as ingredient of the Dependency Pairs method) for proving innermost termination of non-terminating term rewrite systems.

Mirtha-Lina Fernández, Guillem Godoy, Alber

Real-time Traffic

Innermost Parallel Monotonicity | Innermost Termination | Recursive Path Ordering | RTA 2005 | Theoretical Computer Science |

claim paper

Related Content

» Improved Modular Termination Proofs Using Dependency Pairs

» Mechanizing and Improving Dependency Pairs

» Proving Termination Properties with muterm

» Recursive Path Orderings Can Also Be Incremental

» POP and Semantic Labeling Using SAT

» Termination of Innermost ContextSensitive Rewriting Using Dependency Pairs

» Proving Innermost Normalisation Automatically

» Automated Termination Proofs with AProVE

» From Outermost Termination to Innermost Termination

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	RTA
Authors	Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio

Comments (0)