List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Proving Termination of C Programs with Lists | 2024-04-26 | Paper |
| Proving termination of programs with bitvector arithmetic by symbolic execution Software Engineering and Formal Methods | 2018-07-06 | Paper |
| Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution Journal of Logical and Algebraic Methods in Programming | 2018-06-27 | Paper |
| Lower bounds for runtime complexity of term rewriting Journal of Automated Reasoning | 2017-08-15 | Paper |
| Inferring lower bounds for runtime complexity | 2017-07-12 | Paper |
| Analyzing program termination and complexity automatically with \textsf{AProVE} Journal of Automated Reasoning | 2017-07-10 | Paper |
| Automatically proving termination and memory safety for programs with pointer arithmetic Journal of Automated Reasoning | 2017-07-10 | Paper |
| Lower runtime bounds for integer programs Automated Reasoning | 2016-09-05 | Paper |
| Proving termination and memory safety for programs with pointer arithmetic Automated Reasoning | 2014-09-26 | Paper |
Research outcomes over time
This page was built for person: Jera Hensel
