| Publication | Date of Publication | Type |
|---|
| A finite abstraction of real-valued functions for complete reasoning about influence | 2026-02-26 | Paper |
Verifying and interpreting neural networks using finite automata
Information and Computation | 2026-02-02 | Paper |
| Verifying and interpreting neural networks using finite automata | 2025-01-31 | Paper |
| Separating the expressive power of propositional dynamic and modal fixpoint logics | 2024-11-26 | Paper |
Model checking timed recursive CTL
Information and Computation | 2024-05-24 | Paper |
| Formal Reasoning About Influence in Natural Sciences Experiments | 2024-04-26 | Paper |
Capturing bisimulation-invariant exponential-time complexity classes
(available as arXiv preprint) | 2024-02-08 | Paper |
| Capturing bisimulation-invariant exponential-time complexity classes | 2024-02-08 | Paper |
Weights of formal languages based on geometric series with an application to automatic grading
Theoretical Computer Science | 2024-01-05 | Paper |
| Temporal Logic with Recursion. | 2023-11-02 | Paper |
| Model Checking Timed Recursive CTL. | 2023-10-02 | Paper |
The tail-recursive fragment of timed recursive CTL
Information and Computation | 2023-09-27 | Paper |
| A Decidable Non-Regular Modal Fixpoint Logic | 2023-08-21 | Paper |
| Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. | 2023-08-08 | Paper |
Local higher-order fixpoint iteration
Information and Computation | 2022-12-08 | Paper |
| A similarity measure for formal languages based on convergent geometric series | 2022-08-16 | Paper |
scientific article; zbMATH DE number 7455743 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-11 | Paper |
| scientific article; zbMATH DE number 7455743 (Why is no real title available?) | 2022-01-11 | Paper |
Alternation is strict for higher-order modal fixpoint logic
(available as arXiv preprint) | 2021-12-07 | Paper |
| Alternation is strict for higher-order modal fixpoint logic | 2021-12-07 | Paper |
A canonical model construction for iteration-free PDL with intersection
(available as arXiv preprint) | 2021-12-07 | Paper |
| A canonical model construction for iteration-free PDL with intersection | 2021-12-07 | Paper |
Temporal logic with recursion
Information and Computation | 2021-11-25 | Paper |
The complexity of model-checking tail-recursive higher-order fixpoint logic
Fundamenta Informaticae | 2021-05-21 | Paper |
On guarded transformation in the modal -calculus
Logic Journal of the IGPL | 2019-01-08 | Paper |
| Space-efficient fragments of higher-order fixpoint logic | 2017-12-20 | Paper |
On the relationship between higher-order recursion schemes and higher-order fixpoint logic
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Alternating parity Krivine automata
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
