| 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 (1), 3-31, 2017 | 143 | 2017 |
| Proving Termination of Programs Automatically with AProVE J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ... International Joint Conference on Automated Reasoning, 184-191, 2014 | 114 | 2014 |
| 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 (1), 33-65, 2017 | 32 | 2017 |
| Lower runtime bounds for integer programs F Frohn, M Naaf, J Hensel, M Brockschmidt, J Giesl International Joint Conference on Automated Reasoning, 550-567, 2016 | 32 | 2016 |
| AProVE: Termination and Memory Safety of C Programs T Ströder, C Aschermann, F Frohn, J Hensel, J Giesl International Conference on Tools and Algorithms for the Construction and …, 2015 | 28 | 2015 |
| Proving termination and memory safety for programs with pointer arithmetic T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ... International Joint Conference on Automated Reasoning, 208-223, 2014 | 23 | 2014 |
| Complexity analysis for java with aprove F Frohn, J Giesl International Conference on Integrated Formal Methods, 85-101, 2017 | 21 | 2017 |
| Complexity analysis for term rewriting by integer transition systems M Naaf, F Frohn, M Brockschmidt, C Fuhs, J Giesl International Symposium on Frontiers of Combining Systems, 132-150, 2017 | 18 | 2017 |
| Proving Non-Termination via Loop Acceleration F Frohn, J Giesl arXiv preprint arXiv:1905.11187, 2019 | 17 | 2019 |
| Proving termination of programs with bitvector arithmetic by symbolic execution J Hensel, J Giesl, F Frohn, T Ströder International Conference on Software Engineering and Formal Methods, 234-252, 2016 | 17 | 2016 |
| Termination of triangular integer loops is decidable F Frohn, J Giesl International Conference on Computer Aided Verification, 426-444, 2019 | 16 | 2019 |
| Lower bounds for runtime complexity of term rewriting F Frohn, J Giesl, J Hensel, C Aschermann, T Ströder Journal of Automated Reasoning 59 (1), 121-163, 2017 | 16 | 2017 |
| A calculus for modular loop acceleration F Frohn International Conference on Tools and Algorithms for the Construction and …, 2020 | 14 | 2020 |
| Polynomial Loops: Beyond Termination. M Hark, F Frohn, J Giesl LPAR 20, 279-297, 2020 | 12 | 2020 |
| 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 | 11 | 2018 |
| Analyzing runtime complexity via innermost runtime complexity F Frohn, J Giesl LPAR 17, 249-268, 2017 | 10 | 2017 |
| AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs J Hensel, F Emrich, F Frohn, T Ströder, J Giesl International Conference on Tools and Algorithms for the Construction and …, 2017 | 10 | 2017 |
| 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 | 10 | 2015 |
| Termination of polynomial loops F Frohn, M Hark, J Giesl International Static Analysis Symposium, 89-112, 2020 | 9 | 2020 |
| Inferring lower runtime bounds for integer programs F Frohn, M Naaf, M Brockschmidt, J Giesl ACM Transactions on Programming Languages and Systems (TOPLAS) 42 (3), 1-50, 2020 | 9 | 2020 |
Jürgen GieslProfessor of Computer Science, RWTH Aachen UniversityVerified email at informatik.rwth-aachen.de
