Search Techniques for Rational Polynomial Orders. - Carsten Fuhs; Rafael Navarro-Marset; Carsten Otto; Jürgen Giesl; Salvador Lucas; Peter Schneider-Kamp (AISC/MKM/Calculemus, 2008)

Termination Graphs for Java Bytecode. - Marc Brockschmidt; Carsten Otto; Christian von Essen; Jürgen Giesl (Verification, Induction, Termination Analysis, 2010)

Automated Termination Analysis of Java Bytecode by Term Rewriting. - Carsten Otto; Marc Brockschmidt; Christian von Essen; Jürgen Giesl (RTA, 2010)

AProVE - Automated Program VerificationEnvironment. - Carsten Otto (EEFSW, 2011)

Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode. - Marc Brockschmidt; Thomas Ströder; Carsten Otto; Jürgen Giesl (FoVeOOS, 2011)

Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting. - Marc Brockschmidt; Carsten Otto; Jürgen Giesl (RTA, 2011)

Automated Termination Proofs for Java Programs with Cyclic Data. - Marc Brockschmidt; Richard Musiol; Carsten Otto; Jürgen Giesl (CAV, 2012)

Proving Termination of Programs Automatically with AProVE. - Jürgen Giesl; Marc Brockschmidt; Fabian Emmes; Florian Frohn; Carsten Fuhs; Carsten Otto; Martin Plücker; Peter Schneider-Kamp; Thomas Ströder; Stephanie Swiderski; René Thiemann (IJCAR, 2014)

Java program analysis by symbolic execution. - Carsten Otto (2015)

Analyzing Program Termination and Complexity Automatically with AProVE. - Jürgen Giesl; Cornelius Aschermann; Marc Brockschmidt; Fabian Emmes; Florian Frohn; Carsten Fuhs; Jera Hensel; Carsten Otto; Martin Plücker; Peter Schneider-Kamp; Thomas Ströder; Stephanie Swiderski; et al. (J. Autom. Reason., 2017)