Jera Hensel

According to our database, Jera Hensel authored at least 15 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Automated termination analysis of C programs.

Jera Hensel

PhD thesis, 2023

Automated Termination Proofs for C Programs with Lists (Short WST Version).

Jera Hensel, Jürgen Giesl

CoRR, 2023

AProVE: Modular Termination Analysis of Memory-Manipulating C Programs.

Frank Emrich, Jera Hensel, Jürgen Giesl

CoRR, 2023

Proving Termination of C Programs with Lists.

Jera Hensel, Jürgen Giesl

Proceedings of the Automated Deduction - CADE 29, 2023

2022

AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution).

Jera Hensel, Constantin Mensendiek, Jürgen Giesl

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

2018

Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution.

Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder

J. Log. Algebraic Methods Program., 2018

2017

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann

J. Autom. Reason., 2017

Analyzing Program Termination and Complexity Automatically with AProVE.

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

J. Autom. Reason., 2017

Lower Bounds for Runtime Complexity of Term Rewriting.

Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder

J. Autom. Reason., 2017

AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution).

Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl

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.

Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder

Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

Lower Runtime Bounds for Integer Programs.

Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015

AProVE: Termination and Memory Safety of C Programs - (Competition Contribution).

Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Inferring Lower Bounds for Runtime Complexity.

Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014

Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014