Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors. - Thomas Ströder; Maurice Pagnucco (IJCAI, 2009)

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. - Thomas Ströder; Peter Schneider-Kamp; Jürgen Giesl (LOPSTR, 2010)

Automated termination analysis for logic programs with cut. - Peter Schneider-Kamp; Jürgen Giesl; Thomas Ströder; Alexander Serebrenik; René Thiemann (Theory Pract. Log. Program., 2010)

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

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. - Thomas Ströder; Fabian Emmes; Peter Schneider-Kamp; Jürgen Giesl; Carsten Fuhs (LOPSTR, 2011)

Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. - Jürgen Giesl; Thomas Ströder; Peter Schneider-Kamp; Fabian Emmes; Carsten Fuhs (LOPSTR, 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)

Proving Termination and Memory Safety for Programs with Pointer Arithmetic. - Thomas Ströder; Jürgen Giesl; Marc Brockschmidt; Florian Frohn; Carsten Fuhs; Jera Hensel; Peter Schneider-Kamp (IJCAR, 2014)

Inferring Lower Bounds for Runtime Complexity. - Florian Frohn; Jürgen Giesl; Jera Hensel; Cornelius Aschermann; Thomas Ströder (RTA, 2015)

AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). - Thomas Ströder; Cornelius Aschermann; Florian Frohn; Jera Hensel; Jürgen Giesl (TACAS, 2015)

Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. - Jera Hensel; Jürgen Giesl; Florian Frohn; Thomas Ströder (SEFM, 2016)

AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). - Jera Hensel; Frank Emrich; Florian Frohn; Thomas Ströder; Jürgen Giesl (TACAS (2), 2017)

Lower Bounds for Runtime Complexity of Term Rewriting. - Florian Frohn; Jürgen Giesl; Jera Hensel; Cornelius Aschermann; Thomas Ströder (J. Autom. Reason., 2017)

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)

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. - Thomas Ströder; Jürgen Giesl; Marc Brockschmidt; Florian Frohn; Carsten Fuhs; Jera Hensel; Peter Schneider-Kamp; Cornelius Aschermann (J. Autom. Reason., 2017)

Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution. - Jera Hensel; Jürgen Giesl; Florian Frohn; Thomas Ströder (J. Log. Algebraic Methods Program., 2018)

Symbolic execution and program synthesis: a general methodology for software verification. - Thomas Ströder (2019)

From Bugs to Benefits: Improving User Stories by Leveraging Crowd Knowledge with CrUISE-AC. - Stefan Schwedt; Thomas Ströder (ICSE, 2025)