A typed encoding of boxed into safe ambients

DOI10.1007/s00236-005-0002-8zbMath1089.68021OpenAlexW2034719240MaRDI QIDQ2491209

Francesca Levi

Publication date: 26 May 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0002-8

zbMATH Keywords

mandatory access control

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Theory of programming languages (68N15)

Related Items (4)

Towards a unified approach to encodability and separation results for process calculi ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ A taxonomy of process calculi for distribution and mobility ⋮ On the Relative Expressive Power of Calculi for Mobility

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. I
• Mobile ambients
• Validating firewalls using flow logics
• Typing evolving ambients
• What is a ``good encoding of guarded choice?
• Orderly communication in the ambient calculus.
• Behavioural typing for safe ambients
• On abstract interpretation of mobile ambients
• Types for the ambient calculus
• Communication and mobility control in boxed ambients
• An overview of Boxed Ambients
• A Type Inference Algorithm for Secure Ambients
• Equational properties of mobile ambients
• On the Expressiveness of Pure Mobile Ambients
• Shape analysis for mobile ambients
• Controlling interference in ambients
• Secure safe ambients
• Bisimulation congruences in safe ambients
• Programming Languages and Systems
• Mathematical Foundations of Computer Science 2004

This page was built for publication: A typed encoding of boxed into safe ambients