Sciweavers

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

10

CADE
2001
Springer

favoriteEmaildiscussreport

133views Logical Reasoning» more CADE 2001»

Approximating Dependency Graphs Using Tree Automata Techniques

13 years 9 months ago

Approximating Dependency Graphs Using Tree Automata Techniques

Download www.lri.fr

The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved by using tree automata techniques to obtain better approximations of the dependency graph. This graph determines the ordering constraints that need to be solved in order to conclude termination. We further show that by using our approximations the dependency pair method provides a decision procedure for termination of right-ground rewrite systems.

Aart Middeldorp

Real-time Traffic

CADE 2001 | Dependency Pair Method | Rewrite Systems | Term Rewrite Systems |

claim paper

Related Content

» Beyond Dependency Graphs

» Probabilistic regular graphs

» Approximate Shortest Distance Computing A QueryDependent Local Landmark Scheme

» Constraintbased Tree Pattern Mining

» Underspecified computation of normal forms

» Malware Analysis with Tree Automata Inference

» Tree pattern mining with tree automata constraints

» Inference of EventRecording Automata Using Timed Decision Trees

» XPath Whole Query Optimization

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CADE
Authors	Aart Middeldorp

Comments (0)