Controlling interference in ambients
- 5 January 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 352-364
- https://doi.org/10.1145/325694.325741
Abstract
Two forms of interferences are individuated in Cardelli and Gordon's Mobile Ambients (MA): plain interferences, which are similar to the interferences one finds in CCS and φ-calculus; and grave interferences, which are more dangerous and may be regarded as programming errors. To control interferences, the MA movement primitives are modified. On the new calculus, the Mobile Safe Ambients (SA), a type system is defined that: controls the mobility of ambients; removes all grave interferences. Other advantages of SA are: a useful algebraic theory; programs sometimes more robust (they require milder conditions for correctness) and/or simpler. These points are illustrated on several examples.Keywords
This publication has 11 references indexed in Scilit:
- A calculus of mobile processes, IPublished by Elsevier ,2004
- Types for mobile ambientsPublished by Association for Computing Machinery (ACM) ,1999
- Mobility Types for Mobile AmbientsPublished by Springer Nature ,1999
- Scale-Space Theories in Computer VisionPublished by Springer Nature ,1999
- A typed language for distributed mobile processes (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- Mobile ambientsPublished by Springer Nature ,1998
- Linearity and the pi-calculusPublished by Association for Computing Machinery (ACM) ,1996
- A calculus of mobile agentsPublished by Springer Nature ,1996
- Barbed bisimulationPublished by Springer Nature ,1992
- Syntactic control of interferencePublished by Association for Computing Machinery (ACM) ,1978