Pages that link to "Item:Q5756741"
From MaRDI portal
The following pages link to Termination Analysis with Calling Context Graphs (Q5756741):
Displaying 14 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- Run-time complexity bounds using squeezers (Q2233463) (← links)
- ACL2s: “The ACL2 Sedan” (Q2867932) (← links)
- The ACL2 Sedan Theorem Proving System (Q3000661) (← links)
- Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems (Q3194732) (← links)
- All-Termination(T) (Q3617771) (← links)
- (Q5020657) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
- Formal verification of termination criteria for first-order recursive functions (Q6149593) (← links)
- Integrating testing and interactive theorem proving (Q6586529) (← links)
