Tom Chothia, Ian Stark  @ NUS Home/Search
Context
Related
| homepages.inf.ed.ac.uk/sta...discla.pdf Cached: PS.gz PS PDF Image Update Help From: homepages.inf.ed.a...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces a process calculus designed to capture the phenomenon of names which are known universally but always refer to local information. Our system extends the #-calculus so that a channel name can have within its scope several disjoint local areas. Such a channel name may be used for communication within an area, it may be sent between areas, but it cannot itself be used to transmit information from one area to another. Areas are arranged in a hierarchy of levels, distinguishing ... (Update)
Similar documents (at the sentence level):
64.5%: A Distributed Pi-Calculus with Local Areas of Communication - Chothia, Stark (2001) (Correct)
16.0%: The Local Area π-Calculus - Chothia (2003) (Correct)
12.6%: Encoding Distributed Areas and Local Communication into the.. - Chothia, Stark (2002) (Correct)
Active bibliography (related documents): More All
0.1: On Asynchrony in Name-Passing Calculi - Merro, Sangiorgi (1998) (Correct)
0.1: Locality and Polyadicity in Asynchronous Name-Passing Calculi - Merro (2000) (Correct)
0.1: Interpreting Functions as π-Calculus Processes: A Tutorial - Sangiorgi (1999) (Correct)
Similar documents based on text: More All
0.2: An Example Paper - Name (Correct)
0.2: A Type Inference Algorithm for Secure Ambients - Barbanera.. (2001) (Correct)
0.2: How Many Argument Digits are Needed to Produce n Result Digits? - Heckmann (1999) (Correct)
BibTeX entry: (Update)
@misc{ chothia-distributed,
author = "Tom Chothia and Ian Stark",
title = "A Distributed π-Calculus with Local Areas of Communication",
url = "citeseer.comp.nus.edu.sg/688940.html" }
Citations (may not include all citations):167 Resource access control in systems of mobile agents - Hennessy, Riely - 1998
137 Laboratory for Foundations of Computer Science (context) - Milner, -calculus et al. - 1991
116 A typed language for distributed mobile processes - Hennessy, Riely - 1998
94 Seven good reasons for mobile agents (context) - Lange, Oshima - 1999
57 Compiling Standard ML to Java bytecodes - Benton, Kennedy et al. - 1998
47 The reflexive CHAM and the joincalculus - Fournet, Gonthier - 1996
45 Asynchrony and the #-calculus (context) - Boudol - 1992
42 Globallocal subtyping and capability inference distributed #.. - Global, subtyping et al. - 1998
34 Theoretical Computer Science (context) - Amadio, mobility - 2000
30 Locality and non-interleaving semantics in calculi for mobil.. - Sangiorgi - 1996
28 Mobile ambients (context) - Cardelli, Gordon - 1998
8 The name discipline of receptiveness (context) - Sangiorgi - 1997
4 From higher-order #-calculus to #-calculus in the presence o.. (context) - Vivas, Dam - 1998
2 Reasoning about concurrent systems using types (context) - Sangiorgi - 1999
http://www.iana.org/numbers.html#P
Documents on the same site (http://homepages.inf.ed.ac.uk/stark/publications.html): More
Thimble - Threads for MLj - Stark (Correct)
Automatic Verification of Java Design Patterns - Alex Blewitt Alan (Correct)
Observable Properties of Higher Order Functions - That Dynamically Create (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.