2D Dependency Pairs for Proving Operational Termination of CTRSs

DOI10.1007/978-3-319-12904-4_11zbMath1367.68145OpenAlexW123114693MaRDI QIDQ2945138

José Meseguer, Salvador Lucas

Publication date: 9 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-12904-4_11

zbMATH Keywords

program analysisconditional term rewritingdependency pairsoperational termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Unnamed Item ⋮ The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors ⋮ Dependency pairs for proving termination properties of conditional term rewriting systems ⋮ The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques ⋮ Use of logical models for proving infeasibility in term rewriting ⋮ Term orderings for non-reachability of (conditional) rewriting

This page was built for publication: 2D Dependency Pairs for Proving Operational Termination of CTRSs