• Publications
  • Influence
Resource Access Control in Systems of Mobile Agents
TLDR
We present a typing system for a distributed π-calculus which guarantees that distributed agents cannot access the resources of a system without first being granted the capability to do so. Expand
  • 304
  • 27
  • PDF
Local Memory via Layout Randomization
TLDR
In this paper, we study the use of randomization to achieve the secrecy and integrity guarantees for local memory. Expand
  • 59
  • 14
  • PDF
Specifications of a high-level conflict-free firewall policy language for multi-domain networks
TLDR
We propose FLIP, a high-level firewall configuration policy language for traffic access control, to enforce security and ensure seamless configuration management. Expand
  • 76
  • 10
  • PDF
Trust and partial typing in open systems of mobile agents
TLDR
We present a partially-typed semantics for D¿, a distributed ¿-calculus. Expand
  • 100
  • 7
Resource Access Control in Systems of Mobile Agents
We describe a typing system for a distributed ?-calculus which guarantees that distributed agents cannot access the resources of a system without first being granted the capability to do so. TheExpand
  • 120
  • 6
On Thin Air Reads Towards an Event Structures Model of Relaxed Memory
  • A. Jeffrey, J. Riely
  • Computer Science, Mathematics
  • 31st Annual ACM/IEEE Symposium on Logic in…
  • 5 July 2016
TLDR
We show that well-justified configurations satisfy the DRF theorem: in any data-race free program, they are sequentially consistent. Expand
  • 47
  • 5
  • PDF
Testing-Based Abstractions for Value-Passing Systems
TLDR
We present a framework for the abstract interpretation of processes that pass values and show that an abstraction over values induces an abstract semantics for processes. Expand
  • 51
  • 5
  • PDF
Typed parametric polymorphism for aspects
TLDR
We believe our work is the first source-level typing scheme for an aspect-based extension of a parametric object-oriented language with aspects. Expand
  • 47
  • 5
  • PDF
Information flow vs. resource access in the asynchronous pi-calculus
TLDR
We propose an extension of the asynchronous π-calculus in which a variety of security properties may be captured using types, by varying slightly the allowed set of types, captures different notions of security. Expand
  • 109
  • 4
  • PDF
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus
TLDR
We propose an extension of the asynchronous π-calculus in which a variety of security properties may be captured using types. Expand
  • 65
  • 4