Searching for authors named "James Riely" – sorted by Relevance.
-
Testing-Based Abstractions for Value-Passing Systems
- ions for Value-Passing Systems ? Rance Cleaveland ?? and James Riely ??? 1 Dept. of Computer Science, N.C. State University, Raleigh, NC 27695-8206, USA 2 Dept. of Computer Science, University of N.C., Chapel Hill, NC 27599-3175, USA email: rance@csc.ncsu.edu, riely@cs.unc.edu Abstract.
- Cited by 15 (1 self) – Add To MetaCart
-
Flattening is an Improvement
- ) James Riely 1 and Jan Prins 2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested parallel constructs, introducing flat parallel (vector) operations in their place. We define a sufficient syntactic conditio
- Cited by 4 (0 self) – Add To MetaCart
-
Secure Resource Access for Mobile Agents
- . In open distributed systems of mobile agents, where code from remote sites may run locally, protection of sensitive data and system resources is of paramount importance. We present a capability-based typing system that provides such protection, using a mix of static and runtime typing. We formaliz
- Cited by 1 (0 self) – Add To MetaCart
-
Dynamic policy discovery with remote attestation
- Abstract. Remote attestation allows programs running on trusted hardware to prove their identity (and that of their environment) to programs on other hosts. Remote attestation can be used to address security concerns if programs agree on the meaning of data in attestations. This paper studies the en
- Cited by 3 (2 self) – Add To MetaCart
-
Access Control Based on Code Identity for Open Distributed Systems
- Abstract. In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behavior of an agent. We study the relationship between code identity, static analysis and trust in open distribute
- Cited by 1 (0 self) – Add To MetaCart
-
Type-Safe Execution of Mobile Agents in Anonymous Networks
- . We present a partially-typed semantics for Dp, a distributed p-calculus. The semantics is designed for open distributed systems in which some sites may harbor malicious agents. Nonetheless, the semantics guarantee traditional type-safety properties at "good" locations by using a mixture of static
- Cited by 30 (2 self) – Add To MetaCart
-
Trust and Partial Typing in Open Systems of Mobile Agents
- . We present a partially-typed semantics for Dp, a distributed p-calculus. The semantics is designed for mobile agents in open distributed systems in which some sites may harbor malicious intentions. Nonetheless, the semantics guarantees traditional type-safety properties at good locations by using
- Cited by 67 (10 self) – Add To MetaCart
-
A Typed Language for Distributed Mobile Processes (Extended Abstract)
- We describe a foundational language for specifying dynamically evolving networks of distributed processes, Dp. The language is a distributed extension of the p-calculus which incorporates the notions of remote execution, migration, and site failure. Novel features of Dp include 1. Communication chan
- Cited by 75 (4 self) – Add To MetaCart
-
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract)
- ) Matthew Hennessy 1 and James Riely 2 1 COGS, University of Sussex, UK email:matthewh@cogs.sussex.ac.uk, home page: http://www.cogs.susx.ac.uk/users/matthewh/ 2 DePaul University, US email:jriley@cs.depaul.edu home page: http://www.depaul.edu/ jriely/ Abstract. We propose an extension
- Cited by 55 (0 self) – Add To MetaCart
-
Resource Access Control in Systems of Mobile Agents
- INTRODUCTION Mobile computation, where independent agents roam widely distributed networks in search of resources and information, is fast becoming a reality. A number of programming languages, APIs and protocols have recently emerged which seek to provide high-level support for mobile agents. These
- Cited by 169 (18 self) – Add To MetaCart

