| Publication | Date of Publication | Type |
|---|
| Why propositional quantification makes modal logics on trees robustly hard? | 2024-12-19 | Paper |
| Reasoning about reversal-bounded counter machines | 2024-09-06 | Paper |
| First steps towards taming description logics with strings | 2024-05-29 | Paper |
| On Composing Finite Forests with Modal Logics | 2023-04-05 | Paper |
| Internal Calculi for Separation Logic | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5101338 | 2022-08-30 | Paper |
| On Temporal and Separation Logics | 2022-05-28 | Paper |
| Strategic reasoning with a bounded number of resources: the quest for tractability | 2021-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155678 | 2021-10-08 | Paper |
| Internal proof calculi for modal logics with separating conjunction | 2021-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999260 | 2021-07-06 | Paper |
| Modal Logics with Composition on Finite Forests | 2021-01-21 | Paper |
| On Symbolic Heaps Modulo Permission Theories | 2020-11-25 | Paper |
| Axiomatising logics with separating conjunction and modalities | 2020-02-18 | Paper |
| The power of modal separation logics | 2020-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224566 | 2019-07-24 | Paper |
| A simple tableau system for the logic of elsewhere | 2019-01-10 | Paper |
| On the complexity of resource-bounded logics | 2018-11-23 | Paper |
| Separation logics and modalities: a survey | 2018-09-12 | Paper |
| The effects of adding reachability predicates in propositional separation logic | 2018-07-17 | Paper |
| Equivalence between model-checking flat counter systems and Presburger arithmetic | 2018-06-05 | Paper |
| Expressive completeness of separation logic with two variables and no separating conjunction | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636289 | 2018-04-23 | Paper |
| On the complexity of resource-bounded logics | 2018-03-26 | Paper |
| Separation logic with one quantified variable | 2017-10-20 | Paper |
| Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction | 2017-07-12 | Paper |
| Reasoning about Data Repetitions with Counter Systems | 2017-07-03 | Paper |
| Two-Variable Separation Logic and Its Inner Circle | 2017-01-27 | Paper |
| Temporal logics on strings with prefix relation | 2016-10-07 | Paper |
| Reasoning about Data Repetitions with Counter Systems | 2016-09-08 | Paper |
| Temporal Logics in Computer Science | 2016-05-11 | Paper |
| Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic | 2015-10-28 | Paper |
| LTL with the freeze quantifier and register automata | 2015-09-17 | Paper |
| Taming past LTL and flat counter systems | 2015-06-01 | Paper |
| Separation Logic with One Quantified Variable | 2014-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419877 | 2014-06-11 | Paper |
| Witness Runs for Counter Machines | 2013-10-04 | Paper |
| Witness Runs for Counter Machines | 2013-09-20 | Paper |
| On the Complexity of Verifying Regular Properties on Flat Counter Systems, | 2013-08-07 | Paper |
| On selective unboundedness of VASS | 2013-07-24 | Paper |
| Model-Checking Bounded Multi-Pushdown Systems | 2013-06-14 | Paper |
| Automata-Based Computation of Temporal Equilibrium Models | 2013-03-13 | Paper |
| Specification and Verification using Temporal Logics | 2013-02-26 | Paper |
| The covering and boundedness problems for branching vector addition systems | 2013-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2920125 | 2012-10-24 | Paper |
| Petri Net Reachability Graphs: Decidability Status of First Order Properties | 2012-10-22 | Paper |
| Temporal Logics of Repeating Values | 2012-10-19 | Paper |
| Taming Past LTL and Flat Counter Systems | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2911619 | 2012-08-31 | Paper |
| Model-checking CTL* over flat Presburger counter systems | 2012-07-17 | Paper |
| On the almighty wand | 2012-05-24 | Paper |
| The Complexity of Reversal-Bounded Model-Checking | 2011-10-07 | Paper |
| Reasoning about sequences of memory states | 2011-08-26 | Paper |
| The complexity of linear-time temporal logic over the class of ordinals | 2011-03-08 | Paper |
| Complexity of modal logics with Presburger constraints | 2010-09-15 | Paper |
| Model checking memoryful linear-time logics over one-counter automata | 2010-05-27 | Paper |
| When Model-Checking Freeze LTL over Counter Machines Becomes Decidable | 2010-04-27 | Paper |
| The Effects of Bounding Syntactic Resources on Presburger LTL | 2010-01-14 | Paper |
| Linear-time temporal logics with Presburger constraints: an overview ★ | 2009-11-30 | Paper |
| Presburger Modal Logic Is PSPACE-Complete | 2009-03-12 | Paper |
| Verification of qualitative \(\mathbb Z\) constraints | 2008-12-12 | Paper |
| On the Almighty Wand | 2008-11-20 | Paper |
| Towards a Model-Checker for Counter Systems | 2008-09-04 | Paper |
| The Complexity of Temporal Logic with Until and Since over Ordinals | 2008-05-15 | Paper |
| Model Checking Freeze LTL over One-Counter Automata | 2008-04-11 | Paper |
| Reasoning About Sequences of Memory States | 2008-01-04 | Paper |
| A Decidable Temporal Logic of Repeating Values | 2008-01-04 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| REASONING ABOUT TRANSFINITE SEQUENCES | 2007-03-13 | Paper |
| An automata-theoretic approach to constraint LTL | 2007-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3425576 | 2007-02-26 | Paper |
| On the freeze quantifier in Constraint LTL: Decidability and complexity | 2007-02-19 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-10 | Paper |
| LTL over integer periodicity constraints | 2006-09-14 | Paper |
| A Reduction from DLP to PDL | 2006-03-09 | Paper |
| Deciding regular grammar logics with converse through first-order logic | 2005-10-04 | Paper |
| A Modal Perspective on Path Constraints | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736876 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430396 | 2003-10-09 | Paper |
| A polynomial space construction of tree-like models for logics with local chains of modal connectives | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415249 | 2003-07-28 | Paper |
| Display Calculi for Nominal Tense Logics | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796537 | 2003-06-02 | Paper |
| Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics | 2003-03-13 | Paper |
| The complexity of propositional linear temporal logics in simple cases | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329271 | 2002-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542619 | 2002-08-04 | Paper |
| The Complexity of Regularity in Grammar Logics and Related Modal Logics | 2002-07-24 | Paper |
| Display calculi for logics with relative accessibility relations | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537437 | 2002-06-30 | Paper |
| Incomplete information: Structure, inference, complexity | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708314 | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721196 | 2001-07-01 | Paper |
| On modal logics characterized by models with relative accessibility relations. I | 2001-02-25 | Paper |
| On modal logics characterized by models with relative accessibility relations. II | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4507858 | 2001-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503908 | 2001-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944959 | 2000-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263154 | 2000-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263012 | 2000-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263013 | 2000-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250246 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250056 | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264704 | 1999-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246974 | 1999-10-05 | Paper |
| Every finitely reducible logic has the finite model property with respect to the class of \(\lozenge\)-formulae | 1999-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381382 | 1999-08-19 | Paper |
| A logic with relative knowledge operators | 1999-05-11 | Paper |
| A class of decidable information logics | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375809 | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4354885 | 1997-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4345015 | 1997-08-18 | Paper |
| A completeness proof for a logic with an alternative necessity operator | 1997-06-15 | Paper |
| Towards reasoning about Hoare relations | 1997-03-25 | Paper |
| 3-SAT = SAT for a class of normal modal logics | 1997-02-28 | Paper |
| Logical analysis of demonic nondeterministic programs | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4881681 | 1996-06-11 | Paper |
| Uniform and non uniform strategies for tableaux calculi for modal logics | 1995-11-28 | Paper |
| A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics | 1994-01-04 | Paper |
