The following pages link to Jürgen Giesl (Q199242):
Displaying 5 items.
- Automated termination proofs for logic programs by term rewriting (Q2946588) (← links)
- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) (Q6492742) (← links)
- Proving Termination of C Programs with Lists (Q6492749) (← links)
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs (Q6492754) (← links)
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs (Q6496615) (← links)
