scientific article; zbMATH DE number 2043537

MaRDI QIDQ4447241zbMATH OpenFDO

Authors Nao Hirokawa, Aart Middeldorp

Publication date 16 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2706/27060311.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Term Rewriting and Applications
• Tyrolean termination tool: techniques and features
• Nagoya termination tool
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• Proving termination by dependency pairs and inductive theorem proving

Cited in

(13)

• FORT 2.0
• Automating the dependency pair method
• Modular and incremental automated termination proofs
• TPA: Termination Proved Automatically
• scientific article; zbMATH DE number 3921958 (Why is no real title available?)
• Real_Impl
• ProTeM: a proof term manipulator (system description)
• Nagoya termination tool
• Complexity Analysis by Rewriting
• Term Rewriting and Applications
• Certifying the weighted path order (invited talk)
• Termination of string rewriting proved automatically
• Tyrolean termination tool: techniques and features

Describes a project that uses

Uses Software

• Tsukuba

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4447241)