Sciweavers

286 search results - page 18 / 58
» Pitfalls in Formal Reasoning about Security Protocols
Sort
View
79
Voted
TASE
2009
IEEE
15 years 4 months ago
Verifying Self-stabilizing Population Protocols with Coq
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
Yuxin Deng, Jean-François Monin
OPODIS
2004
14 years 11 months ago
A Constraint-Based Formalism for Consistency in Replicated Systems
Abstract. We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requ...
Marc Shapiro, Karthikeyan Bhargavan, Nishith Krish...
ENTCS
2000
112views more  ENTCS 2000»
14 years 9 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato
ISCIS
2004
Springer
15 years 2 months ago
Correctness Requirements for Multiagent Commitment Protocols
Abstract. Commitments are a powerful abstraction for representing the interactions between agents. Commitments capture the content of the interactions declaratively and allow agent...
Pinar Yolum
ENTCS
2007
87views more  ENTCS 2007»
14 years 9 months ago
Temporal Logics of Knowledge and their Applications in Security
Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over...
Clare Dixon, M. Carmen Fernández Gago, Mich...