J.-C. Kassing and J. Giesl
Experiments on Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Detailed description of our experiments to evaluate the contributions of the above paper, 2023.

J. Hensel and J. Giesl
Experiments on Proving Termination of C Programs with Lists
Detailed description of our experiments to evaluate the contributions of the above paper, 2023.

F. Frohn and J. Giesl
Experiments on Proving Non-Termination by Acceleration Driven Clause Learning
Detailed description of our experiments to evaluate the contributions of the above paper, 2023.

N. Lommen, F. Meyer, and J. Giesl
Experiments on Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Detailed description of our experiments to evaluate the contributions of the above paper, 2022.

F. Frohn and J. Giesl
Experiments on Proving Non-Termination and Lower Runtime Bounds with LoAT
Detailed description of our experiments to evaluate the contributions of the above paper, 2022.

J. Giesl, N. Lommen, M. Hark, and F. Meyer
Experiments on Improving Automatic Complexity Analysis of Integer Programs
Detailed description of our experiments to evaluate the contributions of the above paper, 2022.

F. Meyer, M. Hark, and J. Giesl
Experiments on Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Detailed description of our experiments to evaluate the contributions of the above paper, 2021.

F. Frohn, M. Naaf, M. Brockschmidt, and J. Giesl
Experiments on Inferring Lower Runtime Bounds for Integer Programs
Detailed description of our experiments to evaluate the contributions of the above paper, 2020.

F. Frohn and J. Giesl
Experiments on Proving Non-Termination via Loop Acceleration
Detailed description of our experiments to evaluate the contributions of the above paper, 2019.

J. Giesl, P. Giesl, and M. Hark
Experiments on Computing Expected Runtimes for Constant Probability Programs
Detailed description of our experiments to evaluate the contributions of the above paper, 2019.

J. Hensel, J. Giesl, F. Frohn, and T. Ströder
Experiments on Termination and Complexity Analysis for Programs with Bitvector Arithmetic by Symbolic Execution
Detailed description of our experiments to evaluate the contributions of the above paper, 2018.

F. Frohn and J. Giesl
Experiments on Complexity Analysis for Java with AProVE
Detailed description of our experiments to evaluate the contributions of the above paper, 2017.

M. Naaf, F. Frohn, M. Brockschmidt, C. Fuhs, and J. Giesl
Experiments on Complexity Analysis for Term Rewriting by Integer Transition Systems
Detailed description of our experiments to evaluate the contributions of the above paper, 2017.

F. Frohn, J. Giesl, J. Hensel, C. Aschermann, and T. Ströder
Experiments on Lower Bounds for Runtime Complexity of Term Rewriting
Detailed description of our experiments to evaluate the contributions of the above paper, 2017.

F. Frohn and J. Giesl
Experiments on Analyzing Runtime Complexity via Innermost Runtime Complexity
Detailed description of our experiments to evaluate the contributions of the above paper, 2017.

T. Ströder, J. Giesl, M. Brockschmidt, F. Frohn, C. Fuhs, J. Hensel, P. Schneider-Kamp, and C. Aschermann
Experiments on Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic
Detailed description of our experiments to evaluate the contributions of the above paper, 2016.

M. Brockschmidt, F. Emmes, S. Falke, C. Fuhs, and J. Giesl
Experiments on Analyzing Runtime and Size Complexity of Integer Programs
Detailed description of our experiments to evaluate the contributions of the above paper, 2016.

F. Frohn, M. Naaf, J. Hensel, M. Brockschmidt, and J. Giesl
Experiments on Lower Runtime Bounds for Integer Programs
Detailed description of our experiments to evaluate the contributions of the above paper, 2016.

J. Hensel, J. Giesl, F. Frohn, and T. Ströder
Experiments on Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution
Detailed description of our experiments to evaluate the contributions of the above paper, 2016.

F. Frohn, J. Giesl, J. Hensel, C. Aschermann, and T. Ströder
Experiments on Inferring Lower Bounds for Runtime Complexity
Detailed description of our experiments to evaluate the contributions of the above paper, 2015.

T. Ströder, J. Giesl, M. Brockschmidt, F. Frohn, C. Fuhs, J. Hensel, and P. Schneider-Kamp
Experiments on Proving Termination and Memory Safety for Programs with Pointer Arithmetic
Detailed description of our experiments to evaluate the contributions of the above paper, 2014.

M. Brockschmidt, F. Emmes, S. Falke, C. Fuhs, and J. Giesl
Experiments on Alternating Runtime and Size Complexity Analysis of Integer Programs
Detailed description of our experiments to evaluate the contributions of the above paper, 2014.

L. Noschinski, F. Emmes, and J. Giesl
Experiments on Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs
Detailed description of our experiments to evaluate the contributions of the above paper, 2013.

M. Brockschmidt, R. Musiol, C. Otto, and J. Giesl
Experiments on Automated Termination Proofs for Java Programs with Cyclic Data
Detailed description of our experiments to evaluate the contributions of the above paper, 2012.

F. Emmes, T. Enger, and J. Giesl
Experiments on Proving Non-Looping Non-Termination Automatically
Detailed description of our experiments to evaluate the contributions of the above paper, 2012.

J. Giesl, T. Ströder, P. Schneider-Kamp, F. Emmes, and C. Fuhs
Experiments on Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs
Detailed description of our experiments to evaluate the contributions of the above paper, 2012.

M. Codish, J. Giesl, P. Schneider-Kamp, and R. Thiemann
Experiments on SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Detailed description of our experiments to evaluate the contributions of the above paper, 2012.

M. Brockschmidt, T. Ströder, C. Otto, and J. Giesl
Experiments on Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode
Detailed description of our experiments to evaluate the contributions of the above paper, 2011.

C. Fuhs, J. Giesl, M. Parting, P. Schneider-Kamp, and S. Swiderski
Experiments on Proving Termination by Dependency Pairs and Inductive Theorem Proving
Detailed description of our experiments to evaluate the contributions of the above paper, 2011.

L. Noschinski, F. Emmes, and J. Giesl
Experiments on The Dependency Pair Framework for Automated Complexity Analysis of Term Rewrite Systems
Detailed description of our experiments to evaluate the contributions of the above paper, 2011.

M. Brockschmidt, C. Otto, and J. Giesl
Experiments on Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
Detailed description of our experiments to evaluate the contributions of the above paper, 2011.

M. Codish, I. Gonopolskiy, A. Ben-Amram, C. Fuhs, and J. Giesl
Experiments on SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
Detailed description of our experiments to evaluate the contributions of the above paper, 2011.

M. Codish, C. Fuhs, J. Giesl, and P. Schneider-Kamp
Experiments on Lazy Abstraction for Size-Change Termination
Detailed description of our experiments to evaluate the contributions of the above paper, 2010.

C. Otto, M. Brockschmidt, C. von Essen, and J. Giesl
Experiments on Automated Termination Analysis of Java Bytecode by Term Rewriting
Detailed description of our experiments to evaluate the contributions of the above paper, 2010.

T. Ströder, P. Schneider-Kamp, and J. Giesl
Experiments on Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
Detailed description of our experiments to evaluate the contributions of the above paper, 2010.

S. Swiderski, M. Parting, J. Giesl, C. Fuhs, and P. Schneider-Kamp
Experiments on Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Detailed description of our experiments to evaluate the contributions of the above paper, 2009.

C. Fuhs, J. Giesl, M. Plücker, P. Schneider-Kamp, and S. Falke
Experiments on Proving Termination of Integer Term Rewriting
Detailed description of our experiments to evaluate the contributions of the above paper, 2009.

B. Alarcón, F. Emmes, C. Fuhs, J. Giesl, R. Gutierrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann
Experiments on Improving Context-Sensitive Dependency Pairs
Detailed description of our experiments to evaluate the contributions of the above paper, 2008.

P. Schneider-Kamp, J. Giesl, A. Serebrenik, and R. Thiemann
Experiments on Automated Termination Proofs for Logic Programs by Term Rewriting
Detailed description of our experiments to evaluate the contributions of the above paper, 2008.

C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl
Experiments on Maximal Termination
Detailed description of our experiments to evaluate the contributions of the above paper, 2008.

R. Thiemann, J. Giesl, and P. Schneider-Kamp
Experiments on Deciding Innermost Loops
Detailed description of our experiments to evaluate the contributions of the above paper, 2008.

C. Fuhs, R. Navarro, C. Otto, J. Giesl, S. Lucas, P. Schneider-Kamp
Experiments on Search Techniques for Rational Polynomial Orders
Detailed description of our experiments to evaluate the contributions of the above paper, 2008.

P. Schneider-Kamp, R. Thiemann, E. Annov, M. Codish, J. Giesl
Experiments on Proving Termination using Recursive Path Orders and SAT Solving
Detailed description of our experiments to evaluate the contributions of the above paper, 2007.

J. Giesl, R. Thiemann, S. Swiderski, and P. Schneider-Kamp
Experiments on Proving Termination by Bounded Increase
Detailed description of our experiments to evaluate the contributions of the above paper, 2007.

C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann, and H. Zankl
Experiments on SAT Solving for Termination Analysis with Polynomial Interpretations
Detailed description of our experiments to evaluate the contributions of the above paper, 2007.

P. Schneider-Kamp, J. Giesl, A. Serebrenik, and R. Thiemann
Experiments on Automated Termination Analysis for Logic Programs by Term Rewriting
Detailed description of our experiments to evaluate the contributions of the above paper, 2006.

J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke
Experiments on Mechanizing and Improving Dependency Pairs
Detailed description of our experiments to evaluate the contributions of the above paper, 2006.

M. Codish, P. Schneider-Kamp, V. Lagoon, R. Thiemann, and J. Giesl
Experiments on SAT Solving for Argument Filterings
Detailed description of our experiments to evaluate the contributions of the above paper, 2006.

J. Giesl, S. Swiderski, P. Schneider-Kamp, and R. Thiemann
Experiments on Automated Termination Analysis for Haskell
Detailed description of our experiments to evaluate the contributions of the above paper, 2006 and 2010.

J. Giesl, R. Thiemann, and P. Schneider-Kamp
Experiments on Proving and Disproving Termination of Higher-Order Functions
Detailed description of our experiments to evaluate the contributions of the above paper, 2005.