Jera Hensel

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 12

Top Topics

Top Venues

J. Autom. Reason.

Publications

Jera Hensel, Jürgen Giesl
Automated Termination Proofs for C Programs with Lists (Short WST Version). CoRR (2023)
Jera Hensel, Jürgen Giesl
Proving Termination of C Programs with Lists. CoRR (2023)
Jera Hensel, Jürgen Giesl
Proving Termination of C Programs with Lists. CADE (2023)
Frank Emrich, Jera Hensel, Jürgen Giesl
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs. CoRR (2023)
Jera Hensel, Constantin Mensendiek, Jürgen Giesl
AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution). TACAS (2) (2022)
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution. J. Log. Algebraic Methods Program. 97 (2018)
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. J. Autom. Reason. 58 (1) (2017)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Lower Bounds for Runtime Complexity of Term Rewriting. J. Autom. Reason. 59 (1) (2017)
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
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58 (1) (2017)
Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). TACAS (2) (2017)
Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl
Lower Runtime Bounds for Integer Programs. IJCAR (2016)
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. SEFM (2016)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Inferring Lower Bounds for Runtime Complexity. RTA (2015)
Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). TACAS (2015)
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
Proving Termination and Memory Safety for Programs with Pointer Arithmetic. IJCAR (2014)