| 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
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Testing containment of object-oriented conjunctive queries is ∏2p-hard
Lecture Notes in Computer Science | 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
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
Optimizing epistemic model checking using conditional independence (extended abstract)
| 2021-12-14 | Paper |
An epistemic foundation for authentication logics (extended abstract)
| 2021-12-14 | Paper |
Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
| 2021-12-07 | Paper |
scientific article; zbMATH DE number 7361815 (Why is no real title available?)
| 2021-06-22 | Paper |
An epistemic strategy logic
ACM Transactions on Computational Logic | 2019-02-07 | Paper |
Dynamic intransitive noninterference revisited
Formal Aspects of Computing | 2018-01-08 | Paper |
The complexity of synchronous notions of information flow security
Theoretical Computer Science | 2016-05-02 | Paper |
Two Applications of Epistemic Logic in Computer Security
Proof, Computation and Agency | 2015-04-17 | Paper |
Information flow in systems with schedulers. II: Refinement
Theoretical Computer Science | 2013-12-04 | Paper |
Model checking Russian cards
| 2013-10-07 | Paper |
Architectural refinement and notions of intransitive noninterference
Formal Aspects of Computing | 2013-03-22 | Paper |
Information flow in systems with schedulers. I: Definitions
Theoretical Computer Science | 2013-02-19 | Paper |
Consistent assignment of quantum probabilities
Journal of Physics A: Mathematical and Theoretical | 2012-03-13 | Paper |
Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
Model Checking and Artificial Intelligence | 2011-05-27 | Paper |
The complexity of epistemic model checking: clock semantics and branching time
| 2011-05-11 | Paper |
A refinement theory that supports reasoning about knowledge and time for synchronous agents
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
A comparison of semantic models for noninterference
Theoretical Computer Science | 2010-11-11 | Paper |
The complexity of synchronous notions of information flow security
Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
Complexity tailored design: a new design methodology for databases with incomplete information.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
Model Checking Knowledge and Linear Time: PSPACE Cases
Logical Foundations of Computer Science | 2008-01-04 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Axioms for logics of knowledge and past time: synchrony and unique initial states
| 2006-08-15 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
scientific article; zbMATH DE number 2196583 (Why is no real title available?)
| 2005-08-22 | Paper |
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing | 2005-02-21 | Paper |
Complete axiomatizations for reasoning about knowledge and branching time
Studia Logica | 2004-01-23 | Paper |
scientific article; zbMATH DE number 1696507 (Why is no real title available?)
| 2002-06-17 | Paper |
scientific article; zbMATH DE number 1500666 (Why is no real title available?)
| 2001-04-09 | Paper |
PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE
International Journal of Foundations of Computer Science | 2001-02-11 | Paper |
scientific article; zbMATH DE number 1512613 (Why is no real title available?)
| 2000-10-03 | Paper |
Containment and Optimization of Object-Preserving Conjunctive Queries
SIAM Journal on Computing | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1182735 (Why is no real title available?)
| 1998-10-28 | Paper |
Common knowledge and update in finite environments
Information and Computation | 1998-07-27 | Paper |
The complexity of querying indefinite data about linearly ordered domains
Journal of Computer and System Sciences | 1997-03-18 | Paper |
The dynamic logic of permission
Journal Of Logic And Computation | 1997-02-09 | Paper |
Recursively indefinite databases
Theoretical Computer Science | 1993-12-06 | Paper |
scientific article; zbMATH DE number 219217 (Why is no real title available?)
| 1993-06-29 | Paper |
scientific article; zbMATH DE number 67825 (Why is no real title available?)
| 1992-09-27 | Paper |
