Controlling interference in ambients

DOI10.1145/325694.325741MaRDI QIDQ5178864zbMATH OpenOpenAlexFDO

Authors Francesca Levi, Davide Sangiorgi

Publication date 17 March 2015

Published in Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/325694.325741

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1954374
• Communication and mobility control in boxed ambients
• An efficient abstract machine for safe ambients
• scientific article; zbMATH DE number 1696439
• M^3: mobility types for mobile processes in mobile ambients

Cited in

(33)

• Probabilistic mobile ambients
• Mobility control via passports
• Flow-sensitive type systems and the ambient calculus
• Typing evolving ambients
• A coordination approach to mobile components
• When ambients cannot be opened
• Orderly communication in the ambient calculus.
• Behavioural typing for safe ambients
• Security boundaries in mobile ambients
• On the expressive power of movement and restriction in pure mobile ambients
• Nesting analysis of mobile ambients
• On abstract interpretation of mobile ambients
• A typed encoding of boxed into safe ambients
• Types for the ambient calculus
• The seal calculus
• Communication and mobility control in boxed ambients
• On an open problem of Amadio and Curien: The finite antichain condition
• A type inference algorithm for secure ambients
• Intensionality of modal logic for robust ambient calculus
• Active evaluation contexts for reaction semantics
• On the expressiveness of the -calculus and the mobile ambients
• scientific article; zbMATH DE number 1927569 (Why is no real title available?)
• On the expressiveness of pure mobile ambients
• A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).
• Minimizing Interference Potential Among Moving Entities
• scientific article; zbMATH DE number 2247716 (Why is no real title available?)
• Applying a testing approach to the calculus of fair ambients
• Space-aware ambients and processes
• Fair ambients
• An efficient abstract machine for safe ambients
• Theory of interaction
• Access control in mobile ambient calculi: a comparative view
• Role-based access control for boxed ambients

This page was built for publication: Controlling interference in ambients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178864)