Sciweavers

286 search results - page 45 / 58
» Pitfalls in Formal Reasoning about Security Protocols
Sort
View
167
Voted
POPL
2007
ACM
15 years 9 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 6 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
112
Voted
CCS
2005
ACM
15 years 3 months ago
PeerAccess: a logic for distributed authorization
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
Marianne Winslett, Charles C. Zhang, Piero A. Bona...
IGPL
2010
117views more  IGPL 2010»
14 years 6 months ago
Executable specification of open multi-agent systems
Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as `ope...
Alexander Artikis, Marek J. Sergot
FMSD
2002
81views more  FMSD 2002»
14 years 9 months ago
A Notation and Logic for Mobile Computing
Abstract. We de ne a concurrent mobile system as one where independently executing components may migrate through some space during the course of the computation, and where the pat...
Gruia-Catalin Roman, Peter J. McCann