EasyChair Smart SlideDocs/Log in
Author: Jürgen Giesl

This page shows all presentations of this author published in EasyChair Smart Slide.

Proving Non-Termination by Acceleration Driven Clause Learning

Proving Non-Termination by Acceleration Driven Clause Learning

Florian Frohn and Jürgen Giesl

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

Jan-Christoph Kassing and Jürgen Giesl

Proving Termination of C Programs with Lists

Proving Termination of C Programs with Lists

Jera Hensel and Jürgen Giesl

Polynomial Loops: Beyond Termination

Polynomial Loops: Beyond Termination

Marcel Hark, Florian Frohn and Jürgen Giesl

Computing Expected Runtimes for Constant Probability Programs

Computing Expected Runtimes for Constant Probability Programs

Jürgen Giesl, Peter Giesl and Marcel Hark

Presentations in this collection: 5
Copyright © 2002 – 2024 EasyChair