An efficient abstract machine for safe ambients

DOI10.1016/J.JLAP.2007.02.003zbMath1116.68056OpenAlexW2085370982MaRDI QIDQ882488

Davide Sangiorgi, Damien Pous, Daniel Hirschkoff

Publication date: 23 May 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://hal-lara.archives-ouvertes.fr/hal-02102483/file/RR2004-63.pdf

zbMATH Keywords

abstract machinebisimulationgarbage collectionmobile ambientsforwarders

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

A decentralised graphical implementation of mobile ambients ⋮ Deriving structural labelled transitions for mobile ambients ⋮ A Decentralized Implementation of Mobile Ambients ⋮ Pict correctness revisited ⋮ GcPan

Uses Software

• JoCaml
• OCaml
• KLAIM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mobile ambients
• Safe ambients: Abstract machine and distributed implementation
• Efficiency of a Good But Not Linear Set Union Algorithm
• Controlling interference in ambients
• Nomadic pict
• Bisimulation congruences in safe ambients
• Programming Languages and Systems
• Automata, Languages and Programming
• CONCUR 2003 - Concurrency Theory
• Formal Methods for Open Object-Based Distributed Systems

This page was built for publication: An efficient abstract machine for safe ambients