Pages that link to "Item:Q1751429"
From MaRDI portal
The following pages link to Use of logical models for proving infeasibility in term rewriting (Q1751429):
Displayed 8 items.
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← 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)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- Automatically Proving and Disproving Feasibility Conditions (Q5049020) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)