Characterizing and proving operational termination of deterministic conditional term rewriting systems
DOI10.1016/J.JLAP.2009.08.001zbMATH Open1206.68163OpenAlexW2150223040MaRDI QIDQ710679FDOQ710679
Bernhard Gramlich, Felix Schernhammer
Publication date: 22 October 2010
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2009.08.001
Recommendations
- Operational termination of conditional term rewriting systems
- Dependency pairs for proving termination properties of conditional term rewriting systems
- 2D dependency pairs for proving operational termination of CTRSs
- Extending the 2D dependency pair framework for conditional term rewriting systems
- Strong and weak operational termination of order-sorted rewrite theories
conditional term rewritingoperational terminationcollapse extended terminationdependency pair frameworktransforming conditional rewrite systems
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)
Cites Work
- Proving termination of context-sensitive rewriting with MU-TERM
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Operational termination of conditional term rewriting systems
- Proving operational termination of membership equational programs
- Unravelings and ultra-properties
- Computationally Equivalent Elimination of Conditions
- Operational Termination of Membership Equational Programs: the Order-Sorted Way
- Frontiers of Combining Systems
- Mechanizing and improving dependency pairs
- Automated Termination Analysis for Logic Programs by Term Rewriting
- Title not available (Why is that?)
- Local Termination
- From Outermost to Context-Sensitive Rewriting
- Improving Context-Sensitive Dependency Pairs
- Transformations of Conditional Rewrite Systems Revisited
- ELAN from a rewriting logic point of view
- Transformation for refining unraveled conditional term rewriting systems
- Improving the context-sensitive dependency graph
- Title not available (Why is that?)
- Context-Sensitive Dependency Pairs
- Term Rewriting and Applications
- Termination proofs of well-moded logic programs via conditional rewrite systems
Cited In (13)
- Twenty years of rewriting logic
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
- Using well-founded relations for proving operational termination
- Determinization of conditional term rewriting systems
- Applications and extensions of context-sensitive rewriting
- An integrated framework for the diagnosis and correction of rule-based programs
- Proving confluence in the confluence framework with confident
- Completion after Program Inversion of Injective Functions
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
- Dependency pairs for proving termination properties of conditional term rewriting systems
- Title not available (Why is that?)
- Transformations of Conditional Rewrite Systems Revisited
- Termination criteria for DPO transformations with injective matches
Uses Software
This page was built for publication: Characterizing and proving operational termination of deterministic conditional term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710679)
