| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6191003 | 2024-02-08 | Paper |
| Weights of formal languages based on geometric series with an application to automatic grading | 2024-01-05 | Paper |
| Reachability in Simple Neural Networks | 2023-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6060093 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6080277 | 2023-10-02 | Paper |
| The tail-recursive fragment of timed recursive CTL | 2023-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6176107 | 2023-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168438 | 2023-08-08 | Paper |
| Reachability is NP-complete even for the simplest neural networks | 2023-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874287 | 2023-02-07 | Paper |
| Local higher-order fixpoint iteration | 2022-12-08 | Paper |
| A similarity measure for formal languages based on convergent geometric series | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079784 | 2022-05-28 | Paper |
| DiMo -- discrete modelling using propositional logic | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5021005 | 2022-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015273 | 2021-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015280 | 2021-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5014446 | 2021-12-02 | Paper |
| Temporal logic with recursion | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994951 | 2021-06-22 | Paper |
| The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic | 2021-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986504 | 2021-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986509 | 2021-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5854737 | 2021-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5151004 | 2021-02-16 | Paper |
| On the expressive power of hybrid branching-time logics | 2020-04-21 | Paper |
| Model checking for hybrid branching-time logics | 2020-01-31 | Paper |
| Specifying program properties using modal fixpoint logics: a survey of results | 2020-01-14 | Paper |
| On guarded transformation in the modal -calculus | 2019-01-08 | Paper |
| Multi-buffer simulations: decidability and complexity | 2018-09-27 | Paper |
| Deciding the unguarded modal -calculus | 2018-08-28 | Paper |
| Space-efficient fragments of higher-order fixpoint logic | 2017-12-20 | Paper |
| Model checking CTL over restricted classes of automatic structures | 2017-12-20 | Paper |
| Ramsey-Based Inclusion Checking for Visibly Pushdown Automata | 2017-07-12 | Paper |
| Temporal Logics in Computer Science | 2016-05-11 | Paper |
| Conjunctive Visibly-Pushdown Path Queries | 2015-09-29 | Paper |
| The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity | 2014-12-02 | Paper |
| Model-checking process equivalences | 2014-12-02 | Paper |
| A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic | 2014-09-26 | Paper |
| Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic | 2014-09-15 | Paper |
| Model Checking for String Problems | 2014-06-24 | Paper |
| Branching-time logics with path relativisation | 2013-12-13 | Paper |
| Satisfiability Games for Branching-Time Logics | 2013-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2848673 | 2013-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2848153 | 2013-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2849561 | 2013-09-20 | Paper |
| Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition | 2013-08-15 | Paper |
| Ramsey Goes Visibly Pushdown | 2013-08-07 | Paper |
| P-hardness of the emptiness problem for visibly pushdown languages | 2013-03-28 | Paper |
| Revealing vs. Concealing: More Simulation Games for Büchi Inclusion | 2013-03-18 | Paper |
| Branching Time? Pruning Time! | 2012-09-05 | Paper |
| TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING | 2012-08-30 | Paper |
| Ramsey-Based Analysis of Parity Automata | 2012-06-29 | Paper |
| Solving parity games by a reduction to SAT | 2012-05-11 | Paper |
| Exact Incremental Analysis of Timed Automata with an SMT-Solver | 2011-10-07 | Paper |
| Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics | 2011-10-07 | Paper |
| Size-Change Termination and Satisfiability for Linear-Time Temporal Logics | 2011-10-07 | Paper |
| More on balanced diets | 2011-07-25 | Paper |
| The Modal μ-Calculus Caught Off Guard | 2011-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086929 | 2011-03-30 | Paper |
| Automatentheorie und Logik | 2011-03-22 | Paper |
| Extended Computation Tree Logic | 2010-10-12 | Paper |
| A CTL-Based Logic for Program Abstractions | 2010-09-29 | Paper |
| A Decision Procedure for CTL* Based on Tableaux and Automata | 2010-09-14 | Paper |
| On regular temporal logics with past | 2010-06-21 | Paper |
| A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL | 2010-06-09 | Paper |
| KI 2003: Advances in Artificial Intelligence | 2010-03-03 | Paper |
| Propositional dynamic logic of context-free programs and fixpoint logic with chop | 2010-01-29 | Paper |
| Model checking for hybrid logic | 2010-01-06 | Paper |
| Solving Parity Games in Practice | 2009-12-01 | Paper |
| On the Hybrid Extension of CTL and CTL + | 2009-10-16 | Paper |
| On Regular Temporal Logics with Past, | 2009-07-14 | Paper |
| Polyadic dynamic logics for HPSG parsing | 2009-05-04 | Paper |
| Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness | 2008-09-18 | Paper |
| Cut-free sequent systems for temporal logic | 2008-09-01 | Paper |
| Analyzing Context-Free Grammars Using an Incremental SAT Solver | 2008-08-19 | Paper |
| Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic | 2008-05-15 | Paper |
| A Proof System for the Linear Time μ-Calculus | 2008-04-17 | Paper |
| Three notes on the complexity of model checking fixpoint logic with chop | 2008-02-15 | Paper |
| The Complexity of Model Checking Higher-Order Fixpoint Logic | 2007-10-11 | Paper |
| Bounded Model Checking for Weak Alternating Büchi Automata | 2007-09-05 | Paper |
| When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus | 2007-08-23 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The alternation hierarchy in fixpoint logic with chop is strict too | 2006-10-19 | Paper |
| 2-Exp Time lower bounds for propositional dynamic logics with intersection | 2006-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5483005 | 2006-08-15 | Paper |
| Model checking propositional dynamic logic with all extras | 2006-06-30 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2005-12-06 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2005-12-06 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| A quick axiomatisation of LTL with past | 2005-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738230 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449218 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484491 | 2003-06-12 | Paper |
| Model Checking Games for Branching Time Logics | 2002-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934536 | 2001-09-10 | Paper |
