Bisimulation congruences in safe ambients

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 71-80

  Merro, Massimo ^a   Hennessy, Matthew ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EQUIVALENCE CLASSES; LINEAR ALGEBRA; SEMANTICS; SET THEORY;

BISIMULATION CONGRUENCES; SAFE AMBIENTS;

PROGRAMMING THEORY;

EID: 0036036538     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503280     Document Type: Conference Paper

References (20)

1. Boxed ambients
2. A commitment relation for the ambient calculus
3. Types for mobile ambients
4. Anytime, anywhere: Modal logics for mobile ambients
5. Mobile ambients
6. Typed behavioural equivalences for processes in the presence of subtyping
7. On reduction-based process semantics
8. Controlling interference in ambients
9. Bisimulation congruences in safe ambients
10. A calculus of mobile processes (Parts I and II)
11. Barbed bisimulation
12. The lazy lambda calculus in a concurrency scenario
13. Bisimulation for higher-order process calculi
14. Extensionality and intensionality of the ambient logic
15. The problem of "Weak bisimulation up to"
16. Transitions systems for the ambient calculus
17. Seal: A framework for secure mobile computations