Prof. Dr. Thomas
Ströder
Werdegang
- 2004 – 2010: Studium der Informatik (Diplom) mit Nebenfach BWL an der RWTH Aachen University, Auslandssemester 2008 an der UNSW Sydney, Stipendiat der Studienstiftung des Deutschen Volkes
- 2010 – 2016: Wissenschaftlicher Mitarbeiter am Lehr- und Forschungsgebiet “Programmiersprachen und Verifikation” an der RWTH Aachen University, Gastforscher bei Microsoft Research in Cambridge 2013
- 2016 – 2019: Hauptabteilungsleiter Full Stack Development bei der METRO, Aufbau und Leitung einer in-house Software-Entwicklungsorganisation
- 2019: Promotion an der RWTH Aachen University im Bereich automatischer Qualitätssicherung und Synthese von Software
- 2020 – 2022: Standortleiter Essen bei der IT-P GmbH, Beratung und Entwicklung sowie Coaching sowohl in Kundenprojekten als auch in-house
- seit 2022: Dozent für Wirtschaftsinformatik an der FHDW
Forschungs- und Beratungsschwerpunkte
- Software-Entwicklungsprozess
- Software-Architektur
- Programmverifikation
- Programmsynthese
- Formale Methoden
- Künstliche Intelligenz
- Team- und Organisationsentwicklung
- Agilität
- Datengetriebene und dezentrale Entscheidungsprozesse
Veröffentlichungen
Hensel, J., Giesl, J., Frohn, F. und Ströder, T. “Termination and Complexity Analysis for Programs With Bitvector Arithmetic by Symbolic Execution”. In: Journal of Logical and Algebraic Methods in Programming (JLAMP) 97 (2018), S. 105–130
Frohn, F., Giesl, J., Hensel, J., Aschermann, C. und Ströder, T. “Lower Bounds for Runtime Complexity of Term Rewriting”. In: Journal of Automated Reasoning (JAR) 59.1 (2017), S. 121–163
Giesl, J., Aschermann, C., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Hensel, J., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. und Thiemann, R. “Analyzing Program Termination and Complexity Automatically With AProVE”. In: Journal of Automated Reasoning (JAR) 58.1 (2017), S. 3–31
Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J., Schneider-Kamp, P. und Aschermann, C. “Automatically Proving Termination and Memory Safety for Programs With Pointer Arithmetic”. In: Journal of Automated Reasoning (JAR) 58.1 (2017), S. 33–65
Schneider-Kamp, P., Giesl, J., Ströder, T., Serebrenik, A. und Thiemann, R. “Automated Termination Analysis for Logic Programs With Cut”. In: Theory and Practice of Logic Programming (TPLP) 10.4-6 (2010). In Proceedings of the 2010 International Conference on Logic Programming (ICLP), Edinburgh, UK, 2010., S. 365–381
Hensel, J., Emrich, F., Frohn, F., Ströder, T. und Giesl, J. “AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution)”. In: Proceedings of the 2017 International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Bd. 10206. Lecture Notes in Computer Science (LNCS). 2017, S. 350–354
Hensel, J., Giesl, J., Frohn, F. und Ströder, T. “Proving Termination of Programs With Bitvector Arithmetic by Symbolic Execution”. In: Proceedings of the 2016 International Conference on Software Engineering and Formal Methods (SEFM). Bd. 9763. Lecture Notes in Computer Science (LNCS). Springer, 2016, S. 234–252
Frohn, F., Giesl, J., Hensel, J., Aschermann, C. und Ströder, T. “Inferring Lower Bounds for Runtime Complexity”. In: Proceedings of the 2015 International Conference on Rewriting Techniques and Applications (RTA). Bd. 36. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl Publishing, 2015, S. 334–349
Ströder, T., Aschermann, C., Frohn, F., Hensel, J. und Giesl, J. “AProVE: Termination and Memory Safety of C Programs (Competition Contribution)”. In: Proceedings of the 2015 International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Bd. 9035. Lecture Notes in Computer Science (LNCS). Springer, 2015, S. 417–419
Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J. und Schneider-Kamp, P. “Proving Termination and Memory Safety for Programs With Pointer Arithmetic”. In: Proceedings of the 2014 International Joint Conference on Automated Reasoning (IJCAR). Bd. 8562. Lecture Notes in Artificial Intelligence (LNAI). Springer, 2014, S. 208–223
Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. und Thiemann, R. “Proving Termination of Programs Automatically With AProVE”. In: Proceedings of the 2014 International Joint Conference on Automated Reasoning (IJCAR). Bd. 8562. Lecture Notes in Artificial Intelligence (LNAI). Springer, 2014, S. 184–191
Giesl, J., Ströder, T., Schneider-Kamp, P., Emmes, F. und Fuhs, C. “Symbolic Evaluation Graphs and Term Rewriting: A General Methodology for Analyzing Logic Programs”. In: Proceedings of the 2012 International Symposium on Principles and Practice of Declarative Programming (PPDP). ACM, 2012, S. 1–12
Brockschmidt, M., Ströder, T., Otto, C. und Giesl, J. “Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode”. In: Proceedings of the 2011 International Conference on Formal Verification of Object-Oriented Software (FoVeOOS). Bd. 7421. Lecture Notes in Computer Science (LNCS). Springer, 2012, S. 123–141
Ströder, T., Emmes, F., Schneider-Kamp, P., Giesl, J. und Fuhs, C. “A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog”. In: Proceedings of the 2011 International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR). Bd. 7225. Lecture Notes in Computer Science (LNCS). Springer, 2012, S. 237–252
Ströder, T., Schneider-Kamp, P. und Giesl, J. “Dependency Triples for Improving Termination Analysis of Logic Programs With Cut”. In: Proceedings of the 2010 International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR). Bd. 6564. Lecture Notes in Computer Science (LNCS). Springer, 2011, S. 184–199
Ströder, T. und Pagnucco, M. “Realising Deterministic Behavior From Multiple Non-Deterministic Behaviors”. In: Proceedings of the 2009 International Joint Conference on Artificial Intelligence (IJCAI). Morgan Kaufmann Publishers Inc., 2009, S. 936–941
