Thomas Ströder

Publication Activity (10 Years)

Years Active: 2009-2018
Publications (10 Years): 6

Top Venues

J. Autom. Reason.

IJCAR

J. Log. Algebraic Methods Program.

TACAS

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution. J. Log. Algebraic Methods Program. 97 (2018)
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. J. Autom. Reason. 58 (1) (2017)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Lower Bounds for Runtime Complexity of Term Rewriting. J. Autom. Reason. 59 (1) (2017)
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, René Thiemann
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58 (1) (2017)
Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). TACAS (2) (2017)
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. SEFM (2016)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Inferring Lower Bounds for Runtime Complexity. RTA (2015)
Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). TACAS (2015)
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
Proving Termination and Memory Safety for Programs with Pointer Arithmetic. IJCAR (2014)
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
Proving Termination of Programs Automatically with AProVE. IJCAR (2014)
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. PPDP (2012)
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. LOPSTR (2012)
Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. LOPSTR (2011)
Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode. FoVeOOS (2011)
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann
Automated Termination Analysis for Logic Programs with Cut CoRR (2010)
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann
Automated termination analysis for logic programs with cut. Theory Pract. Log. Program. 10 (4-6) (2010)
Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. LOPSTR (2010)
Thomas Ströder, Maurice Pagnucco
Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors. IJCAI (2009)

Thomas Ströder.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Ströder