The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
type: Item
instance of: scholarly article
title: The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
zbMATH Open document ID: 1393.68088
author: Salvador Lucas
author: José Meseguer
author: Raúl Gutiérrez
published in: Journal of Computer and System Sciences
publication date: 2018-06-06T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6881616
zbMATH Keywords: conditional term rewriting
zbMATH Keywords: dependency pairs
zbMATH Keywords: program analysis
zbMATH Keywords: operational termination
describes a project that uses: OBJ3
describes a project that uses: Conditional Confluence
describes a project that uses: CafeOBJ
describes a project that uses: ELAN
describes a project that uses: Haskell
describes a project that uses: Maude
MaRDI profile type: Publication
full work available at URL: j.jcss.2018.04.002
OpenAlex ID: W2800121675
cites work: Termination of term rewriting using dependency pairs
cites work: Proving Termination Properties with mu-term
cites work: Conditional rewrite rules: Confluence and termination
cites work: Q4223001
cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
cites work: A rationale for conditional equational programming
cites work: CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
cites work: Verification of Erlang processes by dependency pairs
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Frontiers of Combining Systems
cites work: Mechanizing and improving dependency pairs
cites work: Rewriting Techniques and Applications
cites work: Conditional rewrite rules
cites work: Semi-unification
cites work: Q2980968
cites work: Analysis of rewriting-based systems as first-order theories
cites work: Automatic synthesis of logical models for order-sorted first-order theories
cites work: Use of logical models for proving infeasibility in term rewriting
cites work: Operational termination of conditional term rewriting systems
cites work: 2D Dependency Pairs for Proving Operational Termination of CTRSs
cites work: Dependency pairs for proving termination properties of conditional term rewriting systems
cites work: Normal forms and normal theories in conditional rewriting
cites work: Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems
cites work: Q2783416
cites work: Theory of Formal Systems. (AM-47)
cites work: Conditional Confluence (System Description)
Wikidata QID: Q129912577
DOI: 10.1016/J.JCSS.2018.04.002
description: scientific article; zbMATH DE number 6881616