Florian Frohn

49 papers A 7B 7Journal 23Unranked 10
YearRankTypeTitle / Venue / Authors
2026 — conf
On Deciding Constant Runtime of Linear Loops.
TACAS (2)
Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen
2026 J jnl
On Deciding Constant Runtime of Linear Loops.
CoRR
Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen
2025 A conf
Infinite State Model Checking by Learning Transitive Relations.
CADE
Florian Frohn, Jürgen Giesl
2025 J jnl
Infinite State Model Checking by Learning Transitive Relations.
CoRR
Florian Frohn, Jürgen Giesl
2025 — ed.
Proceedings of the 12th Workshop on Horn Clauses for Verification and Synthesis, HCVS@CAV 2025, Zagreb, Croatia, 22 July 2025.
HCVS@CAV
Emanuele De Angelis, Florian Frohn
2025 J jnl
Termination of triangular polynomial loops.
Formal Methods Syst. Des.
Marcel Hark, Florian Frohn, Jürgen Giesl
2024 J jnl
Accelerated Bounded Model Checking.
CoRR
Florian Frohn, Jürgen Giesl
2024 — conf
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.
FoSSaCS (2)
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
2024 — conf
Integrating Loop Acceleration Into Bounded Model Checking.
FM (1)
Florian Frohn, Jürgen Giesl
2024 — conf
Satisfiability Modulo Exponential Integer Arithmetic.
IJCAR (1)
Florian Frohn, Jürgen Giesl
2024 J jnl
Satisfiability Modulo Exponential Integer Arithmetic.
CoRR
Florian Frohn, Jürgen Giesl
2023 B conf
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses.
SAS
Florian Frohn, Jürgen Giesl
2023 J jnl
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses.
CoRR
Florian Frohn, Jürgen Giesl
2023 J jnl
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.
CoRR
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
2023 A conf
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).
CADE
Florian Frohn, Jürgen Giesl
2023 J jnl
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version).
CoRR
Florian Frohn, Jürgen Giesl
2023 J jnl
Proving Non-Termination by Acceleration Driven Clause Learning with LoAT.
CoRR
Florian Frohn, Jürgen Giesl
2022 J jnl
A calculus for modular loop acceleration and non-termination proofs.
Int. J. Softw. Tools Technol. Transf.
Florian Frohn, Carsten Fuhs
2022 A conf
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description).
IJCAR
Florian Frohn, Jürgen Giesl
2022 J jnl
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description).
CoRR
Florian Frohn, Jürgen Giesl
2021 J jnl
A Calculus for Modular Loop Acceleration and Non-Termination Proofs.
CoRR
Florian Frohn, Carsten Fuhs
2020 — conf
A Calculus for Modular Loop Acceleration.
TACAS (1)
Florian Frohn
2020 J jnl
A Calculus for Modular Loop Acceleration.
CoRR
Florian Frohn
2020 J jnl
Inferring Lower Runtime Bounds for Integer Programs.
ACM Trans. Program. Lang. Syst.
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
2020 B conf
Polynomial Loops: Beyond Termination.
LPAR
Marcel Hark, Florian Frohn, Jürgen Giesl
2020 B conf
Termination of Polynomial Loops.
SAS
Florian Frohn, Marcel Hark, Jürgen Giesl
2019 J jnl
Inferring Lower Runtime Bounds for Integer Programs.
CoRR
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
2019 J jnl
On the Decidability of Termination for Polynomial Loops.
CoRR
Florian Frohn, Marcel Hark, Jürgen Giesl
2019 B conf
Proving Non-Termination via Loop Acceleration.
FMCAD
Florian Frohn, Jürgen Giesl
2019 J jnl
Proving Non-Termination via Loop Acceleration.
CoRR
Florian Frohn, Jürgen Giesl
2019 — conf
Termination of Triangular Integer Loops is Decidable.
CAV (2)
Florian Frohn, Jürgen Giesl
2019 J jnl
Termination of Triangular Integer Loops is Decidable.
CoRR
Florian Frohn, Jürgen Giesl
2018 — —
Automated complexity analysis of rewrite systems.
Florian Frohn
2018 J jnl
Constant runtime complexity of term rewriting is semi-decidable.
Inf. Process. Lett.
Florian Frohn, Jürgen Giesl
2018 J jnl
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution.
J. Log. Algebraic Methods Program.
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
2017 — conf
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution).
TACAS (2)
Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl
2017 J jnl
Analyzing Program Termination and Complexity Automatically with AProVE.
J. Autom. Reason.
Jürgen Giesl, Cornelius Aschermann, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Jera Hensel, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann
2017 B conf
Analyzing Runtime Complexity via Innermost Runtime Complexity.
LPAR
Florian Frohn, Jürgen Giesl
2017 J jnl
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
J. Autom. Reason.
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann
2017 B conf
Complexity Analysis for Java with AProVE.
IFM
Florian Frohn, Jürgen Giesl
2017 — conf
Complexity Analysis for Term Rewriting by Integer Transition Systems.
FroCoS
Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl
2017 J jnl
Lower Bounds for Runtime Complexity of Term Rewriting.
J. Autom. Reason.
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
2016 A conf
Lower Runtime Bounds for Integer Programs.
IJCAR
Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl
2016 B conf
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution.
SEFM
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
2015 A conf
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution).
TACAS
Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl
2015 — conf
Inferring Lower Bounds for Runtime Complexity.
RTA
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
2014 A conf
Proving Termination and Memory Safety for Programs with Pointer Arithmetic.
IJCAR
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
2014 A conf
Proving Termination of Programs Automatically with AProVE.
IJCAR
Jürgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann
2011 — conf
Realisierung eines synchronen Rich-Text-Editors auf Basis eines webbasierten Einbenutzer-Editors.
Informatiktage
Florian Frohn