Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Ron van der Meyden"'
Autor:
Ron van der Meyden
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 251, Iss Proc. TARK 2017, Pp 398-414 (2017)
This paper shows that conditional independence reasoning can be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information satisfies a formula expressed in a modal mult
Externí odkaz:
https://doaj.org/article/33d12eb9acc94193b2e880126474ada5
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 251, Iss Proc. TARK 2017, Pp 306-323 (2017)
While there have been many attempts, going back to BAN logic, to base reasoning about security protocols on epistemic notions, they have not been all that successful. Arguably, this has been due to the particular logics chosen. We present a simple lo
Externí odkaz:
https://doaj.org/article/5617f14d0f644b8e94bf5f12d54e2b2b
Autor:
Xiaowei Huang, Ron van der Meyden
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 202, Iss Proc. SYNT 2015, Pp 120-137 (2016)
Epistemic protocol specifications allow programs, for settings in which multiple agents act with incomplete information, to be described in terms of how actions are related to what the agents know. They are a variant of the knowledge-based programs o
Externí odkaz:
https://doaj.org/article/961c95c0183a419a9f15599b39981c21
Autor:
Xiaowei Huang, Ron van der Meyden
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 35-41 (2014)
The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by other agents.
Externí odkaz:
https://doaj.org/article/b09615f574c1424fb9f4b0a1f398e66f
Autor:
Manas K. Patra, Ron van der Meyden
Publikováno v:
ACM Transactions on Computational Logic. 21:1-26
We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains. Decidability r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6779e425a1cfdb9624df75a2e722fc8a
https://doi.org/10.1145/3409250
https://doi.org/10.1145/3409250
Autor:
Michael J. Maher, Ron van der Meyden
Publikováno v:
BRAINS
This paper proposes an architecture for implementing Y Combinator's Simple Agreements for Future Equity (SAFEs), a class of financial instruments used in funding startups, as smart contracts. We describe design patterns used and the way that aspects
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6454127d41e7055eebc66d703f60e8f5
https://doi.org/10.1109/brains52497.2021.9569831
https://doi.org/10.1109/brains52497.2021.9569831
Autor:
Ron van der Meyden, Xiaowei Huang
Publikováno v:
ACM Transactions on Computational Logic
This article presents an extension of temporal epistemic logic with operators that can express quantification over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34b6a673661c9b0b861f9f16010173fe
https://doi.org/10.1145/3233769
https://doi.org/10.1145/3233769
Autor:
Ron van der Meyden
Publikováno v:
IEEE ICBC
This paper investigates the specification and verification of atomic swap multi-party transactions. It is argued that logics with the ability to express properties of strategies of players in a multi-agent setting are conceptually useful for this pur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93b8f4b0d6b173a09f49d4c3b7d16330
https://doi.org/10.1109/bloc.2019.8751250
https://doi.org/10.1109/bloc.2019.8751250
Publikováno v:
Theoretical Computer Science. 631:16-42
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one in which agents operate synchronously with awareness of the global clock. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a79b2c7cc23dee194e7275d2c2a3ce6
https://doi.org/10.1016/j.tcs.2016.03.011
https://doi.org/10.1016/j.tcs.2016.03.011
Autor:
Ron van der Meyden, Stephen Chong
Publikováno v:
ACM Transactions on Information and System Security. 18:1-30
We demonstrate, by a number of examples, that information flow security properties can be proved from abstract architectural descriptions, which describe only the causal structure of a system and local properties of trusted components. We specify the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bb96726fa2b3ff7b4fdb9f4c19d471c
https://doi.org/10.1145/2829949
https://doi.org/10.1145/2829949