Aderhold, Markus
eds.: Giesl, J. ; Hähnle, R. (2010)
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion.
Conference or Workshop Item

Duffy, David A. ; Giesl, J. (2000)
Closure induction in a Z-like language.
Conference or Workshop Item

Ohsaki, Hitoshi ; Middeldorp, A. ; Giesl, J. (2000)
Equational termination by semantic labelling.
Conference or Workshop Item

Arts, Thomas ; Giesl, J. (2000)
Termination of term rewriting using dependency pairs.
In: Theoretical computer science, 236
Article

Arts, Thomas ; Giesl, J. (1999)
Applying rewriting techniques to the verification of Erlang processes.
Conference or Workshop Item

Brauburger, Jürgen ; Giesl, J. (1999)
Approximating the domains of functional and imperative programs.
In: Science of computer programming, 35
Article

Arts, Thomas ; Giesl, J. (1998)
Modularity of termination using dependency pairs.
Conference or Workshop Item

Brauburger, Jürgen ; Giesl, J. (1998)
Termination analysis by inductive evaluation.
Conference or Workshop Item

Arts, Thomas ; Giesl, J. (1997)
Automatically proving termination where simplification orderings fail.
Conference or Workshop Item

Arts, Thomas ; Giesl, J. (1997)
Proving innermost normalisation automatically.
Conference or Workshop Item

Brauburger, Jürgen ; Giesl, J. (1996)
Termination analysis for partial functions.
Conference or Workshop Item

Arts, Thomas ; Giesl, J. (1996)
Termination of constructor systems.
Conference or Workshop Item