Sciweavers

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

15

RTA
2004
Springer

favoriteEmaildiscussreport

143views Theoretical Computer Science» more RTA 2004»

Dependency Pairs Revisited

13 years 9 months ago

Dependency Pairs Revisited

Download www.jaist.ac.jp

Abstract. In this paper we present some new reﬁnements of the dependency pair method for automatically proving the termination of term rewrite systems. These reﬁnements are very easy to implement, increase the power of the method, result in simpler termination proofs, and make the method more eﬃcient.

Nao Hirokawa, Aart Middeldorp

Real-time Traffic

Dependency Pair Method | RTA 2004 | Simpler Termination Proofs | Term Rewrite Systems | Theoretical Computer Science |

claim paper

Related Content

» Large scale analysis of web revisitation patterns

» Web page revisitation revisited implications of a longterm clickstream study of browser us...

» High Security PairingBased Cryptography Revisited

» Ground State Incongruence in 2D Spin Glasses Revisited

» The Dependency Pair Framework Combining Techniques for Automated Termination Proofs

» GoalDirected and Relative Dependency Pairs for Proving the Termination of Narrowing

» The Derivational Complexity Induced by the Dependency Pair Method

» The sizechange principle and dependency pairs for termination of term rewriting

» Dependency Parsing and Projection Based on WordPair Classification

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	RTA
Authors	Nao Hirokawa, Aart Middeldorp

Comments (0)