Sciweavers

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

9

CADE
2003
Springer

favoriteEmaildiscussreport

152views Logical Reasoning» more CADE 2003»

Automating the Dependency Pair Method

14 years 4 months ago

Automating the Dependency Pair Method

Download www.jaist.ac.jp

Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area in the past few years. The dependency pair method of Arts and Giesl is one of the most popular such methods. However, there are several obstacles that hamper its automation. In this paper we present new ideas to overcome these obstacles. We provide ample numerical data supporting our ideas.

Nao Hirokawa, Aart Middeldorp

Real-time Traffic

Active Research Area | Automated Reasoning | CADE 2003 | Dependency Pair Method | Term Rewrite Systems |

claim paper

Related Content

» Automated Complexity Analysis Based on the Dependency Pair Method

» The Dependency Pair Framework Combining Techniques for Automated Termination Proofs

» Termination Analysis by Dependency Pairs and Inductive Theorem Proving

» Mechanizing and Improving Dependency Pairs

» Dependency Pairs for Rewriting with Nonfree Constructors

» Predictive Labeling with Dependency Pairs Using SAT

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

» An automated approach for finding variableconstant pairing bugs

» Beyond Dependency Graphs

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	CADE
Authors	Nao Hirokawa, Aart Middeldorp

Comments (0)