From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “non-termination” 14

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

A calculus for modular loop acceleration and non-termination proofs
2022 International Journal on Software Tools for Technology Transfer article Computer Science Logic, programming, and type systems Open access

Florian Frohn, Carsten Fuhs

8

citations
A Calculus for Modular Loop Acceleration and Non-Termination Proofs
2021 BIROn (Birkbeck, University of London) article Computer Science Logic, programming, and type systems Open access

Florian Frohn, Carsten Fuhs

0

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

0

citations
AProVE: Non-Termination Witnesses for C Programs
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jera Hensel, Constantin Mensendiek, Jürgen Giesl

10

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

16

citations
Proving Non-Termination by Acceleration Driven Clause Learning
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

2

citations
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

6

citations
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

citations
Termination of Polynomial Loops
2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Florian Frohn, Marcel Hark, Jürgen Giesl

12

citations
AProVE (KoAT + LoAT)
2025 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

5

citations
Polynomial Loops: Beyond Termination
2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access

Marcel Hark, Florian Frohn, Jürgen Giesl

13

citations
Accelerated bounded model checking with LoAT
2026 Science of Computer Programming article Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

citations
Methoden für die automatische Komplexitäts- und Terminierungsanalyse von (probabilistischen) Programmen und ihre Vollständigkeit
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Marcel Hark

1

citations
Formalizing the One-Way to Hiding Theorem
2025 ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) conference-paper Computer Science Quantum Information and Cryptography Open access

Dominique Unruh

1

citations

14 results