Sciweavers

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

105

Voted

CADE
2006
Springer

163views Logical Reasoning» more CADE 2006»

Automatic Termination Proofs in the Dependency Pair Framework

16 years 3 months ago

Automatic Termination Proofs in the Dependency Pair Framework

Download verify.rwth-aachen.de

Jürgen Giesl, Peter Schneider-Kamp, Ren&eacut

Real-time Traffic

Automated Reasoning | Automatic Termination Proofs | CADE 2006 |

claim paper

Related Content

» The Dependency Pair Framework Combining Techniques for Automated Termination Proofs

» Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivati...

» Improving the Contextsensitive Dependency Graph

» Dependency Pairs Revisited

» ContextSensitive Dependency Pairs

» TORPA Termination of Rewriting Proved Automatically

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

» Improved Modular Termination Proofs Using Dependency Pairs

» Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	CADE
Authors	Jürgen Giesl, Peter Schneider-Kamp, René Thiemann

Comments (0)