Pages that link to "Item:Q1341666"
From MaRDI portal
The following pages link to On proving the termination of algorithms by machine (Q1341666):
Displaying 14 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- Fermat, Euler, Wilson -- three case studies in number theory (Q1707601) (← links)
- Proving theorems by reuse (Q1978233) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- Termination Graphs for Java Bytecode (Q3058449) (← links)
- Patching faulty conjectures (Q4647501) (← links)
- Termination of algorithms over non-freely generated data types (Q4647505) (← links)
- INKA: The next generation (Q4647524) (← links)
- Walther recursion (Q4647554) (← links)
- Termination analysis for partial functions (Q5030190) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
