Florian Frohn
Florian Frohn
Max Planck Institute for Informatics, Saarbrücken
Verified email at mpi-inf.mpg.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 (1), 3-31, 2017
1092017
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
1002014
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
302016
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
272015
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
252017
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
222014
Complexity analysis for java with aprove
F Frohn, J Giesl
International Conference on Integrated Formal Methods, 85-101, 2017
142017
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
132016
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
122017
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
112017
Termination of Triangular Integer Loops is Decidable
F Frohn, J Giesl
arXiv preprint arXiv:1905.08664, 2019
102019
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
102015
Analyzing runtime complexity via innermost runtime complexity
F Frohn, J Giesl
LPAR 17, 249-268, 2017
92017
Proving Non-Termination via Loop Acceleration
F Frohn, J Giesl
arXiv preprint arXiv:1905.11187, 2019
82019
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
82018
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
82017
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
Automated Inference of Upper Complexity Bounds for Java Programs
F Frohn, M Brockschmidt, J Giesl
Proceedings of the 15th International Workshop on Termination, 2016
12016
Constant runtime complexity of term rewriting is semi-decidable
F Frohn, J Giesl
Information Processing Letters 139, 18-23, 2018
2018
Modular Heap Shape Analysis for Java Programs
F Frohn, J Giesl
2017
The system can't perform the operation now. Try again later.
Articles 1–20