| Publication | Date of Publication | Type |
|---|
| Finite state implementations of knowledge-based programs (extended abstract) | 2024-07-05 | Paper |
| Optimal Eventual Byzantine Agreement Protocols with Omission Failures | 2024-03-26 | Paper |
| Testing containment of object-oriented conjunctive queries is ∏2p-hard | 2023-12-12 | Paper |
| On reductions from multi-domain noninterference to the two-level case | 2022-08-19 | Paper |
| Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic | 2022-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384082 | 2021-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384076 | 2021-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015397 | 2021-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994889 | 2021-06-22 | Paper |
| An Epistemic Strategy Logic | 2019-02-07 | Paper |
| Dynamic intransitive noninterference revisited | 2018-01-08 | Paper |
| The complexity of synchronous notions of information flow security | 2016-05-02 | Paper |
| Two Applications of Epistemic Logic in Computer Security | 2015-04-17 | Paper |
| Information flow in systems with schedulers. II: Refinement | 2013-12-04 | Paper |
| Model checking Russian cards | 2013-10-07 | Paper |
| Architectural refinement and notions of intransitive noninterference | 2013-03-22 | Paper |
| Information flow in systems with schedulers. I: Definitions | 2013-02-19 | Paper |
| Consistent assignment of quantum probabilities | 2012-03-13 | Paper |
| Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic | 2011-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999188 | 2011-05-11 | Paper |
| A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents | 2011-05-06 | Paper |
| A comparison of semantic models for noninterference | 2010-11-11 | Paper |
| The Complexity of Synchronous Notions of Information Flow Security | 2010-04-27 | Paper |
| Complexity tailored design: a new design methodology for databases with incomplete information. | 2008-12-21 | Paper |
| Model Checking Knowledge and Linear Time: PSPACE Cases | 2008-01-04 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| CONCUR 2005 – Concurrency Theory | 2006-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5483001 | 2006-08-15 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465433 | 2005-08-22 | Paper |
| Complete Axiomatizations for Reasoning about Knowledge and Time | 2005-02-21 | Paper |
| Complete axiomatizations for reasoning about knowledge and branching time | 2004-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766650 | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501688 | 2001-04-09 | Paper |
| PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE | 2001-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508297 | 2000-10-03 | Paper |
| Containment and Optimization of Object-Preserving Conjunctive Queries | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400807 | 1998-10-28 | Paper |
| Common knowledge and update in finite environments | 1998-07-27 | Paper |
| The complexity of querying indefinite data about linearly ordered domains | 1997-03-18 | Paper |
| The dynamic logic of permission | 1997-02-09 | Paper |
| Recursively indefinite databases | 1993-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694699 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013779 | 1992-09-27 | Paper |
