| Publication | Date of Publication | Type |
|---|
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
| 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 |
Reachability in Simple Neural Networks
Fundamenta Informaticae | 2023-11-23 | 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 |
Reachability is NP-complete even for the simplest neural networks
| 2023-03-31 | Paper |
Existential length universality
| 2023-02-07 | Paper |
The fully hybrid \(\mu\)-calculus
| 2023-02-03 | 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 |
On the expressive power of hybrid branching-time logics
| 2022-05-28 | Paper |
DiMo -- discrete modelling using propositional logic
| 2022-03-22 | Paper |
scientific article; zbMATH DE number 7455743 (Why is no real title available?)
| 2022-01-11 | Paper |
Multi-buffer simulations for trace language inclusion
| 2021-12-07 | Paper |
A canonical model construction for iteration-free PDL with intersection
| 2021-12-07 | Paper |
The arity hierarchy in the polyadic \(\mu\)-calculus
| 2021-12-02 | Paper |
Temporal logic with recursion
Information and Computation | 2021-11-25 | Paper |
Buffered simulation games for Büchi automata
| 2021-06-22 | Paper |
The complexity of model-checking tail-recursive higher-order fixpoint logic
Fundamenta Informaticae | 2021-05-21 | Paper |
Model-checking process equivalences
| 2021-04-27 | Paper |
The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
| 2021-04-27 | Paper |
Model-checking the higher-dimensional modal \(\mu\)-calculus
| 2021-03-17 | Paper |
Local strategy improvement for parity game solving
| 2021-02-16 | Paper |
On the expressive power of hybrid branching-time logics
Theoretical Computer Science | 2020-04-21 | Paper |
Model checking for hybrid branching-time logics
Journal of Logical and Algebraic Methods in Programming | 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 \(\mu\)-calculus
Logic Journal of the IGPL | 2019-01-08 | Paper |
Multi-buffer simulations: decidability and complexity
Information and Computation | 2018-09-27 | Paper |
Deciding the unguarded modal \(\mu\)-calculus
Journal of Applied Non-Classical Logics | 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
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Temporal logics in computer science. Finite-state systems
Cambridge Tracts in Theoretical Computer Science | 2016-05-11 | Paper |
Conjunctive visibly-pushdown path queries
Fundamentals of Computation Theory | 2015-09-29 | Paper |
The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
Theoretical Computer Science | 2014-12-02 | Paper |
Model-checking process equivalences
Theoretical Computer Science | 2014-12-02 | Paper |
A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
Automated Reasoning | 2014-09-26 | Paper |
Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Model Checking for String Problems
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Branching-time logics with path relativisation
Journal of Computer and System Sciences | 2013-12-13 | Paper |
Satisfiability games for branching-time logics
Logical Methods in Computer Science | 2013-10-16 | Paper |
Bounded model checking for all regular properties
| 2013-09-26 | Paper |
Parallel and symbolic model checking for fixpoint logic with chop
| 2013-09-25 | Paper |
Game over: the foci approach to LTL satisfiability and model checking
| 2013-09-20 | Paper |
Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition
Electronic Notes in Theoretical Computer Science | 2013-08-15 | Paper |
Ramsey goes visibly pushdown
Automata, Languages, and Programming | 2013-08-07 | Paper |
P-hardness of the emptiness problem for visibly pushdown languages
Information Processing Letters | 2013-03-28 | Paper |
Revealing vs. concealing: more simulation games for Büchi inclusion
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Branching time? Pruning time!
Automated Reasoning | 2012-09-05 | Paper |
Two local strategy iteration schemes for parity game solving
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
Ramsey-based analysis of parity automata
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Exact Incremental Analysis of Timed Automata with an SMT-Solver
Lecture Notes in Computer Science | 2011-10-07 | Paper |
Size-change termination and satisfiability for linear-time temporal logics
Frontiers of Combining Systems | 2011-10-07 | Paper |
Formal language constrained reachability and model checking propositional dynamic logics
Lecture Notes in Computer Science | 2011-10-07 | Paper |
More on balanced diets
Journal of Functional Programming | 2011-07-25 | Paper |
The modal \(\mu \)-calculus caught off guard
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Non-regular fixed-point logics and games
| 2011-03-30 | Paper |
Automatentheorie und Logik
eXamen.press | 2011-03-22 | Paper |
Extended computation tree logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
A CTL-based logic for program abstractions
Logic, Language, Information and Computation | 2010-09-29 | Paper |
A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata
Automated Reasoning | 2010-09-14 | Paper |
On regular temporal logics with past
Acta Informatica | 2010-06-21 | Paper |
A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
Information Processing Letters | 2010-06-09 | Paper |
Satisfiability and completeness of converse-PDL replayed
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Propositional dynamic logic of context-free programs and fixpoint logic with chop
Information Processing Letters | 2010-01-29 | Paper |
Model checking for hybrid logic
Journal of Logic, Language and Information | 2010-01-06 | Paper |
Solving parity games in practice
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
On the Hybrid Extension of CTL and CTL +
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
On Regular Temporal Logics with Past,
Automata, Languages and Programming | 2009-07-14 | Paper |
Polyadic dynamic logics for HPSG parsing
Journal of Logic, Language and Information | 2009-05-04 | Paper |
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Cut-free sequent systems for temporal logic
The Journal of Logic and Algebraic Programming | 2008-09-01 | Paper |
Analyzing Context-Free Grammars Using an Incremental SAT Solver
Automata, Languages and Programming | 2008-08-19 | Paper |
Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
A Proof System for the Linear Time μ-Calculus
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Three notes on the complexity of model checking fixpoint logic with chop
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
The Complexity of Model Checking Higher-Order Fixpoint Logic
Logical Methods in Computer Science | 2007-10-11 | Paper |
Bounded Model Checking for Weak Alternating Büchi Automata
Computer Aided Verification | 2007-09-05 | Paper |
When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
Information and Computation | 2007-08-23 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The alternation hierarchy in fixpoint logic with chop is strict too
Information and Computation | 2006-10-19 | Paper |
2-Exp Time lower bounds for propositional dynamic logics with intersection
Journal of Symbolic Logic | 2006-09-06 | Paper |
A lower complexity bound for propositional dynamic logic with intersection
| 2006-08-15 | Paper |
Model checking propositional dynamic logic with all extras
Journal of Applied Logic | 2006-06-30 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
A quick axiomatisation of LTL with past
MLQ | 2005-02-16 | Paper |
scientific article; zbMATH DE number 2087435 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2038753 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1927566 (Why is no real title available?)
| 2003-06-12 | Paper |
Model Checking Games for Branching Time Logics
Journal Of Logic And Computation | 2002-09-11 | Paper |
scientific article; zbMATH DE number 1390251 (Why is no real title available?)
| 2001-09-10 | Paper |
