Follow
Thomas Ströder
Title
Cited by
Cited by
Year
Analyzing Program Termination and Complexity Automatically with AProVE
J Giesl, C Aschermann, M Brockschmidt, F Emmes, F Frohn, C Fuhs, ...
Journal of Automated Reasoning 58, 3-31, 2017
1772017
Proving Termination of Programs Automatically with AProVE
J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ...
Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as …, 2014
1282014
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode
M Brockschmidt, T Ströder, C Otto, J Giesl
International Conference on Formal Verification of Object-Oriented Software …, 2011
742011
Automated termination analysis for logic programs with cut
P Schneider-Kamp, J Giesl, T Ströder, A Serebrenik, R Thiemann
Theory and Practice of Logic Programming 10 (4-6), 365-381, 2010
422010
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs
J Giesl, T Ströder, P Schneider-Kamp, F Emmes, C Fuhs
Proceedings of the 14th symposium on Principles and practice of declarative …, 2012
412012
Automatically proving termination and memory safety for programs with pointer arithmetic
T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ...
Journal of Automated Reasoning 58, 33-65, 2017
352017
AProVE: Termination and Memory Safety of C Programs: (Competition Contribution)
T Ströder, C Aschermann, F Frohn, J Hensel, J Giesl
International Conference on Tools and Algorithms for the Construction and …, 2015
312015
Proving termination and memory safety for programs with pointer arithmetic
T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ...
Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as …, 2014
262014
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
T Ströder, F Emmes, P Schneider-Kamp, J Giesl, C Fuhs
Logic-Based Program Synthesis and Transformation: 21st International …, 2012
212012
Lower bounds for runtime complexity of term rewriting
F Frohn, J Giesl, J Hensel, C Aschermann, T Ströder
Journal of Automated Reasoning 59, 121-163, 2017
202017
Proving termination of programs with bitvector arithmetic by symbolic execution
J Hensel, J Giesl, F Frohn, T Ströder
Software Engineering and Formal Methods: 14th International Conference, SEFM …, 2016
192016
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
J Hensel, J Giesl, F Frohn, T Ströder
Journal of Logical and Algebraic Methods in Programming 97, 105-130, 2018
182018
Realising deterministic behavior from multiple non-deterministic behaviors
T Stroeder, M Pagnucco
Twenty-First International Joint Conference on Artificial Intelligence, 2009
152009
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs: (Competition Contribution)
J Hensel, F Emrich, F Frohn, T Ströder, J Giesl
International Conference on Tools and Algorithms for the Construction and …, 2017
122017
Inferring lower bounds for runtime complexity
F Frohn, J Giesl, J Hensel, C Aschermann, T Ströder
26th International Conference on Rewriting Techniques and Applications (RTA …, 2015
122015
Dependency triples for improving termination analysis of logic programs with cut
T Ströder, P Schneider-Kamp, J Giesl
Logic-Based Program Synthesis and Transformation: 20th International …, 2011
82011
Towards termination analysis of real Prolog programs
T Ströder
Diploma Thesis, RWTH Aachen, 2010. http://aprove. informatik. rwth-aachen …, 2010
72010
Automated detection of nontermination and NullPointerExceptions for JBC
M Brockschmidt, T Ströder, C Otto, J Giesl
Proc. FoVeOOS 11, 0
6
Symbolic execution and program synthesis: a general methodology for software verification
T Ströder
Dissertation, RWTH Aachen University, 2019, 2019
22019
Refining definitions with unknown opens using XSB for IDP3
J Jansen, G Janssens
Proceedings of the international joint workshop on implementation of …, 2014
22014
The system can't perform the operation now. Try again later.
Articles 1–20