Florian Frohn

Available identifiers

zbMath Open frohn.florianMaRDI QIDQ1647967

List of research outcomes

Publication	Date of Publication	Type
From innermost to full almost-sure termination of probabilistic term rewriting	2024-10-30	Paper
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)	2024-04-26	Paper
Termination of triangular Integer loops is decidable	2024-02-16	Paper
Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)	2022-12-07	Paper
Complexity analysis for \textbf{Java} with \textsf{AProVE}	2022-11-04	Paper
A calculus for modular loop acceleration	2022-10-13	Paper
Termination of polynomial loops	2021-10-18	Paper
Analyzing runtime complexity via innermost runtime complexity	2019-01-10	Paper
Constant runtime complexity of term rewriting is semi-decidable	2018-10-19	Paper
Proving termination of programs with bitvector arithmetic by symbolic execution	2018-07-06	Paper
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution	2018-06-27	Paper
Complexity analysis for term rewriting by integer transition systems	2018-01-04	Paper
Lower bounds for runtime complexity of term rewriting	2017-08-15	Paper
Inferring lower bounds for runtime complexity	2017-07-12	Paper
Analyzing program termination and complexity automatically with \textsf{AProVE}	2017-07-10	Paper
Automatically proving termination and memory safety for programs with pointer arithmetic	2017-07-10	Paper
Lower runtime bounds for integer programs	2016-09-05	Paper
Proving termination of programs automatically with AProVE	2014-09-26	Paper
Proving termination and memory safety for programs with pointer arithmetic	2014-09-26	Paper

Research outcomes over time

This page was built for person: Florian Frohn