Florian Frohn

According to our database, Florian Frohn authored at least 33 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Satisfiability Modulo Exponential Integer Arithmetic.

Florian Frohn, Jürgen Giesl

CoRR, 2024

Accelerated Bounded Model Checking.

Florian Frohn, Jürgen Giesl

CoRR, 2024

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.

Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl

Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023

Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version).

Florian Frohn, Jürgen Giesl

CoRR, 2023

Proving Non-Termination by Acceleration Driven Clause Learning with LoAT.

Florian Frohn, Jürgen Giesl

CoRR, 2023

ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses.

Florian Frohn, Jürgen Giesl

Proceedings of the Static Analysis - 30th International Symposium, 2023

Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).

Florian Frohn, Jürgen Giesl

Proceedings of the Automated Deduction - CADE 29, 2023

2022

A calculus for modular loop acceleration and non-termination proofs.

Florian Frohn, Carsten Fuhs

Int. J. Softw. Tools Technol. Transf., 2022

Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description).

Florian Frohn, Jürgen Giesl

Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2020

Inferring Lower Runtime Bounds for Integer Programs.

Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl

ACM Trans. Program. Lang. Syst., 2020

A Calculus for Modular Loop Acceleration.

Florian Frohn

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Termination of Polynomial Loops.

Florian Frohn, Marcel Hark, Jürgen Giesl

Proceedings of the Static Analysis - 27th International Symposium, 2020

Polynomial Loops: Beyond Termination.

Marcel Hark, Florian Frohn, Jürgen Giesl

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019

On the Decidability of Termination for Polynomial Loops.

Florian Frohn, Marcel Hark, Jürgen Giesl

CoRR, 2019

Proving Non-Termination via Loop Acceleration.

Florian Frohn, Jürgen Giesl

Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

Termination of Triangular Integer Loops is Decidable.

Florian Frohn, Jürgen Giesl

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Automated complexity analysis of rewrite systems.

Florian Frohn

PhD thesis, 2018

Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution.

Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder

J. Log. Algebraic Methods Program., 2018

Constant runtime complexity of term rewriting is semi-decidable.

Florian Frohn, Jürgen Giesl

Inf. Process. Lett., 2018

2017

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, Cornelius Aschermann

J. Autom. Reason., 2017

Analyzing Program Termination and Complexity Automatically with AProVE.

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

J. Autom. Reason., 2017

Lower Bounds for Runtime Complexity of Term Rewriting.

Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder

J. Autom. Reason., 2017

AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution).

Jera Hensel, Frank Emrich, Florian Frohn, Thomas Ströder, Jürgen Giesl

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Analyzing Runtime Complexity via Innermost Runtime Complexity.

Florian Frohn, Jürgen Giesl

Proceedings of the LPAR-21, 2017

Complexity Analysis for Java with AProVE.

Florian Frohn, Jürgen Giesl

Proceedings of the Integrated Formal Methods - 13th International Conference, 2017

Complexity Analysis for Term Rewriting by Integer Transition Systems.

Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016

Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution.

Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder

Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

Lower Runtime Bounds for Integer Programs.

Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015

AProVE: Termination and Memory Safety of C Programs - (Competition Contribution).

Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Inferring Lower Bounds for Runtime Complexity.

Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014

Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

Proving Termination of Programs Automatically with AProVE.

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

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2011

Realisierung eines synchronen Rich-Text-Editors auf Basis eines webbasierten Einbenutzer-Editors.

Florian Frohn

Proceedings of the Informatiktage 2011, 2011