Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems

DOI10.1007/978-3-319-17822-6_7zbMath1457.68136OpenAlexW799904898MaRDI QIDQ2949703

Salvador Lucas, José Meseguer, Raúl Gutiérrez

Publication date: 2 October 2015

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17822-6_7

zbMATH Keywords

program analysisdependency pairsoperational terminationconditional rewriting

Mathematics Subject Classification ID

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

Related Items (4)

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

This page was built for publication: Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems