Follow
Jera Hensel
Jera Hensel
Verified email at cs.rwth-aachen.de
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
1592017
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
342017
Lower runtime bounds for integer programs
F Frohn, M Naaf, J Hensel, M Brockschmidt, J Giesl
Automated Reasoning: 8th International Joint Conference, IJCAR 2016, Coimbra …, 2016
342016
AProVE: Termination and Memory Safety of C Programs: (Competition Contribution)
T Ströder, C Aschermann, F Frohn, J Hensel, J Giesl
Tools and Algorithms for the Construction and Analysis of Systems: 21st …, 2015
272015
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
242014
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
182017
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
182016
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
152018
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
112015
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs: (Competition Contribution)
J Hensel, F Emrich, F Frohn, T Ströder, J Giesl
Tools and Algorithms for the Construction and Analysis of Systems: 23rd …, 2017
102017
AProVE: Non-Termination Witnesses for C Programs: (Competition Contribution)
J Hensel, C Mensendiek, J Giesl
International Conference on Tools and Algorithms for the Construction and …, 2022
52022
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
F Emrich, J Hensel, J Giesl
arXiv preprint arXiv:2302.02382, 2023
22023
Automated termination analysis for programs with pointer arithmetic
T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ...
RWTH Aachen, Department of Computer Science, 2014
22014
Proving Termination of C Programs with Lists
J Hensel, J Giesl
arXiv preprint arXiv:2305.12159, 2023
12023
Aprove at smt-comp 2020
M Brockschmidt, F Frohn, C Fuhs, J Giesl, J Hensel, P Schneider-Kamp, ...
12020
Automated Termination Proofs for C Programs with Lists (Short WST Version)
J Hensel, J Giesl
arXiv preprint arXiv:2307.11024, 2023
2023
Semi-Deciding QF NIA with AProVE via Bit-Blasting
J Giesl, C Aschermann, M Brockschmidt, F Emmes, F Frohn, C Fuhs, ...
Modular Termination Analysis of C Programs
F Emrich, J Hensel, J Giesl
17th International Workshop on Termination, 27, 0
Logikprogrammierung mit Constraints
E Weber, J Giesl, J Hensel
AProVE at SMT-COMP 2019
M Brockschmidt, F Frohn, C Fuhs, J Giesl, J Hensel, P Schneider-Kamp, ...
The system can't perform the operation now. Try again later.
Articles 1–20