From

Institution

Field

Type

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

Reset

Papers matching “decidability” 745

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

An Analysis of the Decidability and Complexity of Numeric Additive Planning
2024 Proceedings of the International Conference on Automated Planning and Scheduling conference-paper Computer Science AI-based Problem Solving and Planning Open access

Hayyan Helal, Gerhard Lakemeyer

1

citations
Experiments and Details for "Scaling Automated Program Verification and Complexity Analysis: From Decidability for Single-Path Loops to Integer Programs and Beyond''
2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

Nils Lommen

0

citations
Experiments and Details for "Scaling Automated Program Verification and Complexity Analysis: From Decidability for Single-Path Loops to Integer Programs and Beyond''
2026 Zenodo (CERN European Organization for Nuclear Research) software Computer Science Logic, programming, and type systems Open access

Nils Lommen

0

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
Finite-valued Streaming String Transducers
2025 TheoretiCS article Computer Science semigroups and automata theory Open access

Emmanuel Filiot, Ismaël Jecker, Anca Muscholl, Gabriele Puppis, Sarah Winter

2

citations
A Regular and Complete Notion of Delay for Streaming String Transducers
2022 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter

1

citations
Deciding Termination of Simple Randomized Loops
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Logic, programming, and type systems Open access

0

citations
Translating Multi-Agent Modal Logics of Knowledge and Belief into Decidable First-Order Fragments
2025 Adaptive Agents and Multi-Agents Systems conference-paper Computer Science Logic, Reasoning, and Knowledge Open access

Qihui Feng, Hannah M. Wilk, Shakil M. Khan, Gerhard Lakemeyer

0

citations
Finite-valued Streaming String Transducers
2024 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science semigroups and automata theory Open access

Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis, Sarah Winter

0

citations
On Deciding Constant Runtime of Linear Loops
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen

0

citations
Simple Numeric Planning with Two Variables Is Decidable
2025 Frontiers in artificial intelligence and applications book-chapter Computer Science AI-based Problem Solving and Planning Open access

Hayyan Helal, Gerhard Lakemeyer

0

citations
On Deciding Constant Runtime of Linear Loops
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen

0

citations
Logics of dependence and independence: The local variants
2021 Journal of Logic and Computation article Computer Science Logic, Reasoning, and Knowledge Open access

Erich Grädel, Phil Pützstück

1

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
A Quadratic Lower Bound for Simulation
2024 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Jan Friso Groote, Jan Martens

0

citations
Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories
2024 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Till Hofmann, Stefan Schupp, Gerhard Lakemeyer

0

citations
Saturation Problems for Families of Automata
2025 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding, Sven Schewe

0

citations
Saturation Problems for Families of Automata
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

0

citations
Resynchronized Uniformization and Definability Problems for Rational Relations
2023 Discrete Mathematics & Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Christof Löding, Sarah Winter

0

citations
Does a Program Yield the Right Distribution?
2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Mingshuai Chen, Joost-Pieter Katoen, Lutz Klinkenberg, Tobias Winkler

14

citations
Approximating Values of Generalized-Reachability Stochastic Games
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Formal Methods in Verification Open access

Pranav Ashok, Krishnendu Chatterjee, Jan Křetínský, Maximilian Weininger, Tobias Winkler

14

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
Approximating Values of Generalized-Reachability Stochastic Games
2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Formal Methods in Verification Open access

10

citations
Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Alex C. Keizer, Henning Basold, Jorge A. Pérez

9

citations
Termination of triangular polynomial loops
2023 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access

Marcel Hark, Florian Frohn, Jürgen Giesl

8

citations