| 2025 | ICSE | From Bugs to Benefits: Improving User Stories by Leveraging Crowd Knowledge with CrUISE-AC. | Stefan Schwedt, Thomas Strder |
| 2017 | TACAS | AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). | Jera Hensel, Frank Emrich, Florian Frohn, Thomas Strder, Jrgen Giesl |
| 2016 | SEFM | Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. | Jera Hensel, Jrgen Giesl, Florian Frohn, Thomas Strder |
| 2015 | TACAS | AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). | Thomas Strder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jrgen Giesl |
| 2014 | CADE | Proving Termination of Programs Automatically with AProVE. | Jrgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Plcker, Peter Schneider-Kamp, Thomas Strder, Stephanie Swiderski, Ren Thiemann |
| 2014 | CADE | Proving Termination and Memory Safety for Programs with Pointer Arithmetic. | Thomas Strder, Jrgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp |
| 2012 | LOPSTR | Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. | Jrgen Giesl, Thomas Strder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs |
| 2012 | PPDP | Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. | Jrgen Giesl, Thomas Strder, Peter Schneider-Kamp, Fabian Emmes, Carsten Fuhs |
| 2011 | LOPSTR | A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. | Thomas Strder, Fabian Emmes, Peter Schneider-Kamp, Jrgen Giesl, Carsten Fuhs |
| 2010 | LOPSTR | Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. | Thomas Strder, Peter Schneider-Kamp, Jrgen Giesl |
| 2009 | IJCAI | Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors. | Thomas Strder, Maurice Pagnucco |