Florian Frohn

Orcid: 0000-0003-0902-1994

Affiliations:

RWTH Aachen University, Germany

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

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Accelerated Bounded Model Checking.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

CoRR, 2024

Satisfiability Modulo Exponential Integer Arithmetic.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

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

[BibT_eX]

[DOI]

Jan-Christoph Kassing

Florian Frohn

Jürgen Giesl

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

Integrating Loop Acceleration Into Bounded Model Checking.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

Proceedings of the Formal Methods - 26th International Symposium, 2024

2023

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

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

CoRR, 2023

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

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

CoRR, 2023

ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

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

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

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

Proceedings of the Automated Deduction - CADE 29, 2023

2022

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

[BibT_eX]

[DOI]

Florian Frohn

Carsten Fuhs

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

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

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

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

2020

Inferring Lower Runtime Bounds for Integer Programs.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2020

A Calculus for Modular Loop Acceleration.

[BibT_eX]

[DOI]

Florian Frohn

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

Termination of Polynomial Loops.

[BibT_eX]

[DOI]

Florian Frohn

Marcel Hark

Jürgen Giesl

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

Polynomial Loops: Beyond Termination.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Florian Frohn

Marcel Hark

Jürgen Giesl

CoRR, 2019

Proving Non-Termination via Loop Acceleration.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

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

Termination of Triangular Integer Loops is Decidable.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

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

2018

Automated complexity analysis of rewrite systems.

[BibT_eX]

[DOI]

Florian Frohn

PhD thesis, 2018

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

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2018

Constant runtime complexity of term rewriting is semi-decidable.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

Inf. Process. Lett., 2018

2017

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

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

Analyzing Program Termination and Complexity Automatically with AProVE.

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

Lower Bounds for Runtime Complexity of Term Rewriting.

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

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

[BibT_eX]

[DOI]

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

Analyzing Runtime Complexity via Innermost Runtime Complexity.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

Proceedings of the LPAR-21, 2017

Complexity Analysis for Java with AProVE.

[BibT_eX]

[DOI]

Florian Frohn

Jürgen Giesl

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

Complexity Analysis for Term Rewriting by Integer Transition Systems.

[BibT_eX]

[DOI]

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

2016

Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution.

[BibT_eX]

[DOI]

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

Lower Runtime Bounds for Integer Programs.

[BibT_eX]

[DOI]

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

2015

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

[BibT_eX]

[DOI]

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

Inferring Lower Bounds for Runtime Complexity.

[BibT_eX]

[DOI]

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

2014

Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

[BibT_eX]

[DOI]

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

Proving Termination of Programs Automatically with AProVE.

[BibT_eX]

[DOI]

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

2011

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

[BibT_eX]

Florian Frohn

Proceedings of the Informatiktage 2011, 2011

Florian Frohn

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...