Thomas Ströder

According to our database1, Thomas Ströder authored at least 17 papers between 2009 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Symbolic execution and program synthesis: a general methodology for software verification.
PhD thesis, 2019

2018
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution.
J. Log. Algebraic Methods Program., 2018

2017
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
J. Autom. Reason., 2017

Analyzing Program Termination and Complexity Automatically with AProVE.
J. Autom. Reason., 2017

Lower Bounds for Runtime Complexity of Term Rewriting.
J. Autom. Reason., 2017

AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

2016
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution.
Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

2015
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Inferring Lower Bounds for Runtime Complexity.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014
Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

Proving Termination of Programs Automatically with AProVE.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2012
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2012

2011
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode.
Proceedings of the Formal Verification of Object-Oriented Software, 2011

2010
Automated termination analysis for logic programs with cut.
Theory Pract. Log. Program., 2010

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2010

2009
Realising Deterministic Behavior from Multiple Non-Deterministic Behaviors.
Proceedings of the IJCAI 2009, 2009


  Loading...