The following pages link to Ron van der Meyden (Q278740):
Displayed 44 items.
- The complexity of synchronous notions of information flow security (Q278742) (← links)
- Information flow in systems with schedulers. II: Refinement (Q383362) (← links)
- A comparison of semantic models for noninterference (Q604479) (← links)
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Item:Q278740 (redirect page) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Complexity tailored design: a new design methodology for databases with incomplete information. (Q960520) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- Complete axiomatizations for reasoning about knowledge and branching time (Q1420806) (← links)
- Dynamic intransitive noninterference revisited (Q1688559) (← links)
- Information flow in systems with schedulers. I: Definitions (Q1935780) (← links)
- Architectural refinement and notions of intransitive noninterference (Q1941885) (← links)
- On reductions from multi-domain noninterference to the two-level case (Q2165480) (← links)
- (Q2766650) (← links)
- (Q2852032) (← links)
- A Refinement Theory that Supports Reasoning about Knowledge and Time for Synchronous Agents (Q2996158) (← links)
- (Q2999188) (← links)
- Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic (Q3003427) (← links)
- Consistent assignment of quantum probabilities (Q3224927) (← links)
- (Q3384076) (← links)
- (Q3384082) (← links)
- The Complexity of Synchronous Notions of Information Flow Security (Q3557857) (← links)
- (Q4013779) (← links)
- (Q4400807) (← links)
- (Q4501688) (← links)
- (Q4508297) (← links)
- PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE (Q4528765) (← links)
- An Epistemic Strategy Logic (Q4617971) (← links)
- Complete Axiomatizations for Reasoning about Knowledge and Time (Q4651488) (← links)
- (Q4694699) (← links)
- The dynamic logic of permission (Q4885627) (← links)
- Containment and Optimization of Object-Preserving Conjunctive Queries (Q4943875) (← links)
- (Q4994889) (← links)
- (Q5015397) (← links)
- Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Q5034220) (← links)
- Two Applications of Epistemic Logic in Computer Security (Q5246113) (← links)
- Computer Science Logic (Q5292655) (← links)
- Computer Aided Verification (Q5312933) (← links)
- Model Checking Knowledge and Linear Time: PSPACE Cases (Q5434507) (← links)
- (Q5465433) (← links)
- (Q5483001) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897508) (← links)
- Testing containment of object-oriented conjunctive queries is ∏2p-hard (Q6064017) (← links)
- Optimal Eventual Byzantine Agreement Protocols with Omission Failures (Q6202257) (← links)