Dependency pairs for proving termination properties of conditional term rewriting systems
From MaRDI portal
Publication:347382
DOI10.1016/J.JLAMP.2016.03.003zbMATH Open1353.68155OpenAlexW2333572417MaRDI QIDQ347382FDOQ347382
Authors: Salvador Lucas, José Meseguer
Publication date: 30 November 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2016.03.003
Recommendations
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- 2D dependency pairs for proving operational termination of CTRSs
- Extending the 2D dependency pair framework for conditional term rewriting systems
- Operational termination of conditional term rewriting systems
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Rewriting Techniques and Applications
- Title not available (Why is that?)
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Operational termination of conditional term rewriting systems
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998
- Proving operational termination of membership equational programs
- Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity
- 2D Dependency Pairs for Proving Operational Termination of CTRSs
- Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems
- Unravelings and ultra-properties
- Proving termination properties with \textsc{mu-term}
- Computationally Equivalent Elimination of Conditions
- MTT: The Maude Termination Tool (System Description)
- Signature extensions preserve termination. An alternative proof via dependency pairs
- Title not available (Why is that?)
- A dependency pair framework for \(A \vee C\)-termination
- Logic Programming
- Logic for Programming, Artificial Intelligence, and Reasoning
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Normal forms and normal theories in conditional rewriting
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- A rationale for conditional equational programming
- Context-sensitive dependency pairs
Cited In (14)
- Automatic generation of logical models with AGES
- mu-term: Verify Termination Properties Automatically (System Description)
- Term orderings for non-reachability of (conditional) rewriting
- Using well-founded relations for proving operational termination
- Automatic synthesis of logical models for order-sorted first-order theories
- Determinization of conditional term rewriting systems
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Use of logical models for proving infeasibility in term rewriting
- Applications and extensions of context-sensitive rewriting
- Verification of Erlang processes by dependency pairs
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Operational termination of conditional term rewriting systems
- Title not available (Why is that?)
Uses Software
This page was built for publication: Dependency pairs for proving termination properties of conditional term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347382)