Pages that link to "Item:Q347382"
From MaRDI portal
The following pages link to Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382):
Displaying 15 items.
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Determinization of conditional term rewriting systems (Q1929232) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- (Q2778873) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Verification of Erlang processes by dependency pairs (Q5941753) (← links)