default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Frohn
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Florian Frohn:
Automated complexity analysis of rewrite systems. RWTH Aachen University, Germany, 2018
Journal Articles
- 2022
- [j7]Florian Frohn
, Carsten Fuhs:
A calculus for modular loop acceleration and non-termination proofs. Int. J. Softw. Tools Technol. Transf. 24(5): 691-715 (2022) - 2020
- [j6]Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl:
Inferring Lower Runtime Bounds for Integer Programs. ACM Trans. Program. Lang. Syst. 42(3): 13:1-13:50 (2020) - 2018
- [j5]Florian Frohn, Jürgen Giesl:
Constant runtime complexity of term rewriting is semi-decidable. Inf. Process. Lett. 139: 18-23 (2018) - [j4]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: 105-130 (2018) - 2017
- [j3]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): 3-31 (2017) - [j2]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): 33-65 (2017) - [j1]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): 121-163 (2017)
Conference and Workshop Papers
- 2024
- [c22]Florian Frohn, Jürgen Giesl:
Integrating Loop Acceleration Into Bounded Model Checking. FM (1) 2024: 73-91 - [c21]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. FoSSaCS (2) 2024: 206-228 - [c20]Florian Frohn, Jürgen Giesl:
Satisfiability Modulo Exponential Integer Arithmetic. IJCAR (1) 2024: 344-365 - 2023
- [c19]Florian Frohn, Jürgen Giesl:
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper). CADE 2023: 220-233 - [c18]Florian Frohn, Jürgen Giesl:
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. SAS 2023: 259-285 - 2022
- [c17]Florian Frohn, Jürgen Giesl:
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). IJCAR 2022: 712-722 - 2020
- [c16]Marcel Hark, Florian Frohn, Jürgen Giesl:
Polynomial Loops: Beyond Termination. LPAR 2020: 279-297 - [c15]Florian Frohn, Marcel Hark, Jürgen Giesl:
Termination of Polynomial Loops. SAS 2020: 89-112 - [c14]Florian Frohn:
A Calculus for Modular Loop Acceleration. TACAS (1) 2020: 58-76 - 2019
- [c13]Florian Frohn, Jürgen Giesl:
Termination of Triangular Integer Loops is Decidable. CAV (2) 2019: 426-444 - [c12]Florian Frohn, Jürgen Giesl:
Proving Non-Termination via Loop Acceleration. FMCAD 2019: 221-230 - 2017
- [c11]Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, Jürgen Giesl:
Complexity Analysis for Term Rewriting by Integer Transition Systems. FroCoS 2017: 132-150 - [c10]Florian Frohn, Jürgen Giesl:
Complexity Analysis for Java with AProVE. IFM 2017: 85-101 - [c9]Florian Frohn, Jürgen Giesl:
Analyzing Runtime Complexity via Innermost Runtime Complexity. LPAR 2017: 249-268 - [c8]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: 350-354 - 2016
- [c7]Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl:
Lower Runtime Bounds for Integer Programs. IJCAR 2016: 550-567 - [c6]Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder:
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. SEFM 2016: 234-252 - 2015
- [c5]Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Inferring Lower Bounds for Runtime Complexity. RTA 2015: 334-349 - [c4]Thomas Ströder, Cornelius Aschermann, Florian Frohn, Jera Hensel, Jürgen Giesl:
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). TACAS 2015: 417-419 - 2014
- [c3]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: 184-191 - [c2]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: 208-223 - 2011
- [c1]Florian Frohn:
Realisierung eines synchronen Rich-Text-Editors auf Basis eines webbasierten Einbenutzer-Editors. Informatiktage 2011: 79-82
Informal and Other Publications
- 2024
- [i13]Florian Frohn, Jürgen Giesl:
Accelerated Bounded Model Checking. CoRR abs/2401.09973 (2024) - [i12]Florian Frohn, Jürgen Giesl:
Satisfiability Modulo Exponential Integer Arithmetic. CoRR abs/2402.01501 (2024) - 2023
- [i11]Florian Frohn, Jürgen Giesl:
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. CoRR abs/2303.01827 (2023) - [i10]Florian Frohn, Jürgen Giesl:
Proving Non-Termination by Acceleration Driven Clause Learning with LoAT. CoRR abs/2304.10166 (2023) - [i9]Florian Frohn, Jürgen Giesl:
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version). CoRR abs/2307.09839 (2023) - [i8]Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl:
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. CoRR abs/2310.06121 (2023) - 2022
- [i7]Florian Frohn, Jürgen Giesl:
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). CoRR abs/2202.04546 (2022) - 2021
- [i6]Florian Frohn, Carsten Fuhs:
A Calculus for Modular Loop Acceleration and Non-Termination Proofs. CoRR abs/2111.13952 (2021) - 2020
- [i5]Florian Frohn:
A Calculus for Modular Loop Acceleration. CoRR abs/2001.01516 (2020) - 2019
- [i4]Florian Frohn, Jürgen Giesl:
Termination of Triangular Integer Loops is Decidable. CoRR abs/1905.08664 (2019) - [i3]Florian Frohn, Jürgen Giesl:
Proving Non-Termination via Loop Acceleration. CoRR abs/1905.11187 (2019) - [i2]Florian Frohn, Marcel Hark, Jürgen Giesl:
On the Decidability of Termination for Polynomial Loops. CoRR abs/1910.11588 (2019) - [i1]Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl:
Inferring Lower Runtime Bounds for Integer Programs. CoRR abs/1911.01077 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
