Pages that link to "Item:Q3525016"
From MaRDI portal
The following pages link to Proving Termination Using Recursive Path Orders and SAT Solving (Q3525016):
Displaying 11 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- KBO orientability (Q846165) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- Encoding Dependency Pair Techniques and Control Strategies for Maximal Completion (Q3454089) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Argument Filterings and Usable Rules for Simply Typed Dependency Pairs (Q3655195) (← links)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
- Complexity Analysis by Rewriting (Q5458433) (← links)
- Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
- Correspondence between composite theories and distributive laws (Q6666781) (← links)
