Pages that link to "Item:Q928655"
From MaRDI portal
The following pages link to Matrix interpretations for proving termination of term rewriting (Q928655):
Displayed 50 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Lazy productivity via termination (Q549188) (← links)
- KBO orientability (Q846165) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Increasing interpretations (Q1044231) (← links)
- From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← 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)
- A Perron-Frobenius theorem for deciding matrix growth (Q2239274) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (Q2947210) (← links)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (Q2980975) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion (Q3454089) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- System Description: E.T. 0.1 (Q3454109) (← links)
- Normalization of Infinite Terms (Q3522036) (← links)
- Automatic Termination (Q3636815) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- Local Termination (Q3636830) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- AC Completion with Termination Tools (Q5200044) (← links)
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)
- Increasing Interpretations (Q5505499) (← links)
- Decreasing Diagrams and Relative Termination (Q5747786) (← links)
- The Derivational Complexity Induced by the Dependency Pair Method (Q5902127) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)