| A Proposal for a Framework to Accompany Formal Methods Learning Tools - (Short Paper). | 0 | 0.34 | 2021 |
| Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics. | 0 | 0.34 | 2021 |
| Reachability is NP-Complete Even for the Simplest Neural Networks. | 0 | 0.34 | 2021 |
| Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. | 0 | 0.34 | 2021 |
| A Decidable Non-Regular Modal Fixpoint Logic. | 0 | 0.34 | 2021 |
| Model checking for hybrid branching-time logics | 0 | 0.34 | 2020 |
| EMFeR: Model Checking for Object Oriented (EMF) Models | 0 | 0.34 | 2019 |
| Specifying Program Properties Using Modal Fixpoint Logics - A Survey of Results. | 0 | 0.34 | 2019 |
| On the expressive power of hybrid branching-time logics | 0 | 0.34 | 2018 |
| The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs. | 0 | 0.34 | 2018 |
| The Fully Hybrid mu-Calculus. | 0 | 0.34 | 2017 |
| Two-Buffer Simulation Games | 1 | 0.37 | 2016 |
| Multi-Buffer Simulations For Trace Language Inclusion | 2 | 0.45 | 2016 |
| Conjunctive Visibly-Pushdown Path Queries | 0 | 0.34 | 2015 |
| Buffered Simulation Games for Büchi Automata. | 0 | 0.34 | 2014 |
| Model Checking for String Problems. | 1 | 0.36 | 2014 |
| Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. | 2 | 0.40 | 2014 |
| Buffered Simulation Games For Buchi Automata | 4 | 0.47 | 2014 |
| Revealing vs. Concealing: More Simulation Games for Büchi Inclusion. | 5 | 0.50 | 2013 |
| Model-Checking The Higher-Dimensionalmodal Mu-Calculus | 3 | 0.42 | 2012 |
| Tableaux(-like) Methods for the Satisfiability Problems of Temporal Logics. | 0 | 0.34 | 2011 |
| To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm. | 18 | 0.82 | 2009 |
| Model Checking Games for Branching Time Logics | 19 | 0.78 | 2002 |
| Model Checking Fixed Point Logic with Chop | 392 | 13.54 | 2002 |
