Pages that link to "Item:Q2392415"
From MaRDI portal
The following pages link to SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415):
Displaying 5 items.
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- AC-KBO revisited (Q4593023) (← links)
