Thomas Ströder

21 papers A* 2A 3B 1C 4Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2025 A* conf
From Bugs to Benefits: Improving User Stories by Leveraging Crowd Knowledge with CrUISE-AC.
ICSE
Stefan Schwedt, Thomas Ströder
2025 J jnl
From Bugs to Benefits: Improving User Stories by Leveraging Crowd Knowledge with CrUISE-AC.
CoRR
Stefan Schwedt, Thomas Ströder
2019 — —
Symbolic execution and program synthesis: a general methodology for software verification.
Thomas Ströder
2018 J jnl
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution.
J. Log. Algebraic Methods Program.
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
2017 — conf
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution).
TACAS (2)
Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl
2017 J jnl
Analyzing Program Termination and Complexity Automatically with AProVE.
J. Autom. Reason.
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
2017 J jnl
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
J. Autom. Reason.
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann
2017 J jnl
Lower Bounds for Runtime Complexity of Term Rewriting.
J. Autom. Reason.
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
2016 B conf
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution.
SEFM
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
2015 A conf
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution).
TACAS
Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl
2015 — conf
Inferring Lower Bounds for Runtime Complexity.
RTA
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
2014 A conf
Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
IJCAR
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
2014 A conf
Proving Termination of Programs Automatically with AProVE.
IJCAR
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
2012 C conf
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs.
LOPSTR
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
2012 C conf
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs.
PPDP
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs
2011 C conf
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog.
LOPSTR
Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs
2011 — conf
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode.
FoVeOOS
Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl
2010 J jnl
Automated Termination Analysis for Logic Programs with Cut
CoRR
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann
2010 J jnl
Automated termination analysis for logic programs with cut.
Theory Pract. Log. Program.
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann
2010 C conf
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut.
LOPSTR
Thomas Ströder, Peter Schneider-Kamp, Jürgen Giesl
2009 A* conf
Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors.
IJCAI
Thomas Ströder, Maurice Pagnucco