Florian Frohn

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
Infinite state model checking by learning transitive relations	2026-01-21	Paper
Accelerating loops with arrays	2026-01-01	Paper
Termination of triangular polynomial loops Formal Methods in System Design	2025-05-07	Paper
Polynomial loops: beyond termination	2025-02-20	Paper
Satisfiability modulo exponential integer arithmetic	2025-01-31	Paper
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 Computer Aided Verification	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} Lecture Notes in Computer Science	2022-11-04	Paper
A calculus for modular loop acceleration Tools and Algorithms for the Construction and Analysis of Systems	2022-10-13	Paper
Termination of polynomial loops	2021-10-18	Paper
Analyzing runtime complexity via innermost runtime complexity EPiC Series in Computing	2019-01-10	Paper
Constant runtime complexity of term rewriting is semi-decidable Information Processing Letters	2018-10-19	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
Complexity analysis for term rewriting by integer transition systems	2018-01-04	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 of programs automatically with AProVE Automated Reasoning	2014-09-26	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: Florian Frohn