Automating the dependency pair method.

DOI10.1007/B11829MaRDI QIDQ5900708zbMATH OpenOpenAlexFDO

Authors Nao Hirokawa, Aart Middeldorp

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11829

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Automating the dependency pair method
• Rewriting Techniques and Applications
• Improving dependency pairs
• Termination of term rewriting using dependency pairs
• Mechanizing and improving dependency pairs

Cited in

(9)

• Automating the dependency pair method
• The size-change principle and dependency pairs for termination of term rewriting
• Certifying a Termination Criterion Based on Graphs, without Graphs
• On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
• Constraints for Argument Filterings
• Rewriting Techniques and Applications
• On proving \(C_E\)-termination of rewriting by size-change termination
• Verifying termination and reduction properties about higher-order logic programs
• Mechanizing and improving dependency pairs

This page was built for publication: Automating the dependency pair method.

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