(Enter summary)
Abstract: We present a simple extension of the ß-calculus with located actions
and channels and with location names as first-class data, which
models the notion of locality and failure present in the higher-order,
distributed programming language Facile. The interaction between
localities and failures distinguishes our approach from previous ones
where the notion of locality is considered in isolation. We argue that
the combination of these two features leads, at least from the distributed
programming... (Update)
Cited by: More
Secure Composition of Insecure Components - Sewell, Vitek (1999)
(Correct)
Mobility Types for Mobile Ambients - Cardelli, Ghelli, Gordon (1999)
(Correct)
Equational Properties of Mobile Ambients - Gordon, Cardelli (1999)
(Correct)
Active bibliography (related documents): More All
0.7: Equivalence Semantics for Concurrency: Comparison and Application - Galpin (1998)
(Correct)
0.3: History-Dependent Automata - Montanari, Pistore (1998)
(Correct)
0.3: Locality and Non-interleaving Semantics in calculi for mobile.. - Sangiorgi (1994)
(Correct)
Similar documents based on text: More All
0.2: Automated Proof Support for Reasoning about Distributed.. - Karthikeyan, Vishwanath (1997)
(Correct)
0.2: Modelling IP Mobility - Amadio, Prasad (1997)
(Correct)
0.2: The Game of the Name in Cryptographic Tables - Amadio, Prasad (1999)
(Correct)
Related documents from co-citation: More All
41: A calculus of mobile agents
- Fournet, Gonthier et al. - 1996
40: Information and Computation (context) - Milner, Parrow et al. - 1992
36: Mobile ambients
- Cardelli, Gordon - 1998
BibTeX entry: (Update)
R. Amadio and S. Prasad. Localities and failures. In Proc. 14th Foundations of Software Technology and Theoretical Computer Science, volume 880 of Lecture Notes in Computer Science. Springer-Verlag, 1994. http://citeseer.ist.psu.edu/amadio95localities.html More
@article{ amadio94localities,
author = "Amadio and Prasad",
title = "Localities and Failures",
journal = "FSTTCS: Foundations of Software Technology and Theoretical Computer Science",
volume = "14",
year = "1994",
url = "citeseer.ist.psu.edu/amadio95localities.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1985
1933
Communication and Concurrency (context) - Milner - 1989
854
Information and Computation (context) - Milner, Parrow et al. - 1992
197
Barbed bisimulation
- Milner, Sangiorgi - 1992
119
Facile: A symmetric integration of concurrent and functional.. (context) - Giacalone, Mishra et al. - 1989
61
Localities and Failures
- Amadio, Prasad - 1994
55
Facile antigua release programming guide (context) - Thomsen, Leth et al. - 1993
54
Distributed computing: models and methods (context) - Lamport, Lynch - 1990
47
Proved trees (context) - Degano, Priami - 1992
30
Locality and non-interleaving semantics in calculi for mobil..
- Sangiorgi - 1994
23
locations and asynchronous transition systems (context) - Mukund, Nielsen - 1992
22
Observing distribution (context) - Castellani - 1993
22
Translating Core Facile
- Amadio - 1994
17
Some issues in the semantics of facile distributed programmi.. (context) - Thomsen, Leth et al. - 1992
15
Formal Aspects of Computing (context) - Aceto, view et al. - 1994
13
Observing Localities (context) - Boudol, Castellani et al. - 1991
13
The Mobility Workbench --- A Tool for the ß-Calculus (context) - Victor, Moller - 1994
12
From a concurrent - calculus to the ß-calculus (context) - Amadio, Leth et al. - 1995
9
Observing located concurrency (context) - Murphy - 1993
8
Technische Universitat Munchen (context) - Kiehn, global et al. - 1991
4
Distribution and locality of concurrent systems (context) - Corradini, De Nicola - 1994
1
Preliminary version in SLNCS 630: Proceedings of CONCUR (context) - Boudol, Castellani et al. - 1994
1
A parametric view of localities (context) - Montanari, Yankelevich - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://protis.univ-mrs.fr/~amadio/biblio_my_amadio.html): More
From a Concurrent lambda-calculus to the pi-calculus - Amadio, Leth, Thomsen
(Correct)
An Analysis of pi-calculus Bisimulations - Amadio, Ait-Mohamed (1995)
(Correct)
An Asynchronous Model of Locality, Failure, and Process Mobility - Amadio (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC