Pages that link to "Item:Q876042"
From MaRDI portal
The following pages link to Tyrolean termination tool: techniques and features (Q876042):
Displaying 41 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- KBO orientability (Q846165) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Methods for proving termination of rewriting-based programming languages by transformation (Q2808239) (← links)
- \texttt{Autowrite}: a tool for term rewrite systems and tree automata (Q2849582) (← links)
- Innermost termination of rewrite systems by labeling (Q2873673) (← links)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
- Tyrolean Complexity Tool: Features and Usage. (Q2958375) (← 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)
- Certification of Termination Proofs Using CeTA (Q3183545) (← links)
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (Q3522011) (← links)
- Maximal Termination (Q3522012) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Arctic Termination ...Below Zero (Q3522019) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Automated Complexity Analysis Based on the Dependency Pair Method (Q3541717) (← links)
- From Outermost Termination to Innermost Termination (Q3599101) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- (Q5089009) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (Q5448658) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
- Increasing Interpretations (Q5505499) (← links)
- Term Rewriting and Applications (Q5703847) (← links)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
- The Derivational Complexity Induced by the Dependency Pair Method (Q5902127) (← links)
