A Dependency Pair Framework for A ∨ C-Termination

DOI10.1007/978-3-642-16310-4_4zbMath1306.68060OpenAlexW1862544530MaRDI QIDQ4933277

Beatriz Alarcón, José Meseguer, Salvador Lucas

Publication date: 12 October 2010

Published in: Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16310-4_4

zbMATH Keywords

terminationdependency pairsequational rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (7)

mu-term: Verify Termination Properties Automatically (System Description) ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ AC-KBO revisited ⋮ AC Completion with Termination Tools ⋮ Proving Termination Properties with mu-term ⋮ Applications and extensions of context-sensitive rewriting

Uses Software

• CafeOBJ
• Maude

This page was built for publication: A Dependency Pair Framework for A ∨ C-Termination