Florian Frohn

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 36

Top Venues

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Florian Frohn, Jürgen Giesl
Accelerated Bounded Model Checking. CoRR (2024)
Florian Frohn, Jürgen Giesl
Satisfiability Modulo Exponential Integer Arithmetic. CoRR (2024)
Florian Frohn, Jürgen Giesl
Satisfiability Modulo Exponential Integer Arithmetic. IJCAR (1) (2024)
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. FoSSaCS (2) (2024)
Florian Frohn, Jürgen Giesl
Proving Non-Termination by Acceleration Driven Clause Learning with LoAT. CoRR (2023)
Florian Frohn, Jürgen Giesl
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. CoRR (2023)
Florian Frohn, Jürgen Giesl
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. SAS (2023)
Florian Frohn, Jürgen Giesl
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version). CoRR (2023)
Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. CoRR (2023)
Florian Frohn, Jürgen Giesl
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper). CADE (2023)
Florian Frohn, Jürgen Giesl
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). IJCAR (2022)
Florian Frohn, Jürgen Giesl
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). CoRR (2022)
Florian Frohn, Carsten Fuhs
A calculus for modular loop acceleration and non-termination proofs. Int. J. Softw. Tools Technol. Transf. 24 (5) (2022)
Florian Frohn, Carsten Fuhs
A Calculus for Modular Loop Acceleration and Non-Termination Proofs. CoRR (2021)
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
Inferring Lower Runtime Bounds for Integer Programs. ACM Trans. Program. Lang. Syst. 42 (3) (2020)
Florian Frohn
A Calculus for Modular Loop Acceleration. TACAS (1) (2020)
Marcel Hark, Florian Frohn, Jürgen Giesl
Polynomial Loops: Beyond Termination. LPAR (2020)
Florian Frohn
A Calculus for Modular Loop Acceleration. CoRR (2020)
Florian Frohn, Marcel Hark, Jürgen Giesl
Termination of Polynomial Loops. SAS (2020)
Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl
Inferring Lower Runtime Bounds for Integer Programs. CoRR (2019)
Florian Frohn, Jürgen Giesl
Proving Non-Termination via Loop Acceleration. FMCAD (2019)
Florian Frohn, Jürgen Giesl
Proving Non-Termination via Loop Acceleration. CoRR (2019)
Florian Frohn, Jürgen Giesl
Termination of Triangular Integer Loops is Decidable. CAV (2) (2019)
Florian Frohn, Marcel Hark, Jürgen Giesl
On the Decidability of Termination for Polynomial Loops. CoRR (2019)
Florian Frohn, Jürgen Giesl
Termination of Triangular Integer Loops is Decidable. CoRR (2019)
Florian Frohn, Jürgen Giesl
Constant runtime complexity of term rewriting is semi-decidable. Inf. Process. Lett. 139 (2018)
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution. J. Log. Algebraic Methods Program. 97 (2018)
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. J. Autom. Reason. 58 (1) (2017)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Lower Bounds for Runtime Complexity of Term Rewriting. J. Autom. Reason. 59 (1) (2017)
Florian Frohn, Jürgen Giesl
Analyzing Runtime Complexity via Innermost Runtime Complexity. LPAR (2017)
Florian Frohn, Jürgen Giesl
Complexity Analysis for Java with AProVE. IFM (2017)
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
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58 (1) (2017)
Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). TACAS (2) (2017)
Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS (2017)
Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl
Lower Runtime Bounds for Integer Programs. IJCAR (2016)
Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. SEFM (2016)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder
Inferring Lower Bounds for Runtime Complexity. RTA (2015)
Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). TACAS (2015)
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
Proving Termination and Memory Safety for Programs with Pointer Arithmetic. IJCAR (2014)
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
Proving Termination of Programs Automatically with AProVE. IJCAR (2014)
Florian Frohn
Realisierung eines synchronen Rich-Text-Editors auf Basis eines webbasierten Einbenutzer-Editors. Informatiktage (2011)

Florian Frohn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Florian Frohn