Realisierung eines synchronen Rich-Text-Editors auf Basis eines webbasierten Einbenutzer-Editors. - Florian Frohn (Informatiktage, 2011)

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 (IJCAR, 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 (IJCAR, 2014)

Inferring Lower Bounds for Runtime Complexity. - Florian Frohn; Jürgen Giesl; Jera Hensel; Cornelius Aschermann; Thomas Ströder (RTA, 2015)

AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). - Thomas Ströder; Cornelius Aschermann; Florian Frohn; Jera Hensel; Jürgen Giesl (TACAS, 2015)

Lower Runtime Bounds for Integer Programs. - Florian Frohn; Matthias Naaf; Jera Hensel; Marc Brockschmidt; Jürgen Giesl (IJCAR, 2016)

Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. - Jera Hensel; Jürgen Giesl; Florian Frohn; Thomas Ströder (SEFM, 2016)

Complexity Analysis for Term Rewriting by Integer Transition Systems. - Matthias Naaf; Florian Frohn; Marc Brockschmidt; Carsten Fuhs; Jürgen Giesl (FroCoS, 2017)

Complexity Analysis for Java with AProVE. - Florian Frohn; Jürgen Giesl (IFM, 2017)

Analyzing Runtime Complexity via Innermost Runtime Complexity. - Florian Frohn; Jürgen Giesl (LPAR, 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 (TACAS (2), 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)

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; et al. (J. Autom. Reason., 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)

Constant runtime complexity of term rewriting is semi-decidable. - Florian Frohn; Jürgen Giesl (Inf. Process. Lett., 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)

Automated complexity analysis of rewrite systems. - Florian Frohn (2018)

Termination of Triangular Integer Loops is Decidable. - Florian Frohn; Jürgen Giesl (CAV (2), 2019)

Proving Non-Termination via Loop Acceleration. - Florian Frohn; Jürgen Giesl (FMCAD, 2019)

On the Decidability of Termination for Polynomial Loops. - Florian Frohn; Marcel Hark; Jürgen Giesl (CoRR, 2019)

Polynomial Loops: Beyond Termination. - Marcel Hark; Florian Frohn; Jürgen Giesl (LPAR, 2020)

Termination of Polynomial Loops. - Florian Frohn; Marcel Hark; Jürgen Giesl (SAS, 2020)

A Calculus for Modular Loop Acceleration. - Florian Frohn (TACAS (1), 2020)

Inferring Lower Runtime Bounds for Integer Programs. - Florian Frohn; Matthias Naaf; Marc Brockschmidt; Jürgen Giesl (ACM Trans. Program. Lang. Syst., 2020)

Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description). - Florian Frohn; Jürgen Giesl (IJCAR, 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 by Acceleration Driven Clause Learning (Short Paper). - Florian Frohn; Jürgen Giesl (CADE, 2023)

ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. - Florian Frohn; Jürgen Giesl (SAS, 2023)

Proving Non-Termination by Acceleration Driven Clause Learning with LoAT. - Florian Frohn; Jürgen Giesl (CoRR, 2023)

Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version). - Florian Frohn; Jürgen Giesl (CoRR, 2023)

Integrating Loop Acceleration Into Bounded Model Checking. - Florian Frohn; Jürgen Giesl (FM (1), 2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting. - Jan-Christoph Kassing; Florian Frohn; Jürgen Giesl (FoSSaCS (2), 2024)

Satisfiability Modulo Exponential Integer Arithmetic. - Florian Frohn; Jürgen Giesl (IJCAR (1), 2024)

Accelerated Bounded Model Checking. - Florian Frohn; Jürgen Giesl (CoRR, 2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. - Jan-Christoph Kassing; Florian Frohn; Jürgen Giesl (Zenodo, 2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. - Jan-Christoph Kassing; Florian Frohn; Jürgen Giesl (Zenodo, 2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. - Jan-Christoph Kassing; Florian Frohn; Jürgen Giesl (Zenodo, 2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. - Jan-Christoph Kassing; Florian Frohn; Jürgen Giesl (Zenodo, 2024)

Infinite State Model Checking by Learning Transitive Relations. - Florian Frohn; Jürgen Giesl (CADE, 2025)

Termination of triangular polynomial loops. - Marcel Hark; Florian Frohn; Jürgen Giesl (Formal Methods Syst. Des., 2025)