Spatial congruence for ambients is decidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1961, Issue , 2000, Pages 88-103

  Zilio, Silvano Dal ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS); SEMANTICS;

AMBIENT CALCULUS; DYNAMIC GENERATION; DYNAMIC SEMANTIC; EQUIVALENCE RELATIONS; MOBILE COMPUTATIONS; PROCESS CALCULI; SUBTLE INTERACTION; TRANSITION SYSTEM;

CALCULATIONS;

EID: 84957804406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. Martìn Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: the spi calculus. Information and Computation, 148:1-70, 1999.
2. Gérard Berry and Gérard Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248, 1992.
3. Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Proceedings of FoS-SaCS '98, volume 1378 of LNCS, pp. 140-155, 1998.
4. Luca Cardelli and Andrew D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Proceedings of POPL '00, pp. 365-377, 2000.
5. Luca Cardelli and Andrew D. Gordon. Logical properties of name restriction. unpublished notes, 2000.
6. Silvano Dal Zilio. Spatial congruence for the ambients is decidable. Technical Report MSR-TR-2000-41, Microsoft Research, May 2000.
7. J. Engelfriet and T. Geselma. Multisets and structural congruence of the pi-calculus with replication. Theoretical Computer Science, 211(1-2):311-337, Jan. 1999.
8. J. Engelfriet and T. Geselma. Structural congruence in the pi-calculus with potential replication. Technical Report 00-02, Leiden Institute of Advanced Computer Science, Jan. 2000.
9. Andrew D. Gordon and Paul D. Hankin. A concurrent object calculus: reduction and typing. In Proceedings of HLCL '98, Elsevier ENTCS, 1998.
10. Daniel Hirschkoff. Mise en oeuvre de preuves de bisimulation. PhD thesis, École Nationale des Ponts et Chaussées, 1999.
11. Daniel Hirschkoff and Romain Kervarc. Implementation of an algorithm to decide spatial congruence for ambients. LIP, École Normale Supérieure de Lyon, August 2000.
12. Robin Milner. Flow graphs and flow algebras. Journal of the ACM, 26(4):794-818, Oct. 1979.
13. Robin Milner. Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, 2000.
14. Vasco T. Vasconcelos. Typed concurrent objects. In Proceedings of ECOOP '94, volume 821 of LNCS, pages 100-117, 1994.