Controlling interference in ambients

From MaRDI portal
Publication:5178864

DOI10.1145/325694.325741zbMath1323.68411OpenAlexW1968065704MaRDI QIDQ5178864

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




Related Items

On the expressive power of movement and restriction in pure mobile ambientsNesting analysis of mobile ambientsOn abstract interpretation of mobile ambientsSpace-aware ambients and processesFair ambientsA 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).An efficient abstract machine for safe ambientsTheory of interactionAccess control in mobile ambient calculi: a comparative viewRole-based access control for boxed ambientsUnnamed ItemOn the Expressiveness of Pure Mobile AmbientsA typed encoding of boxed into safe ambientsA coordination approach to mobile componentsWhen ambients cannot be openedTypes for the ambient calculusOn the Expressiveness of the π-Calculus and the Mobile AmbientsProbabilistic mobile ambientsMobility control via passportsFlow-sensitive type systems and the ambient calculusA Type Inference Algorithm for Secure AmbientsThe seal calculusApplying a testing approach to the Calculus of Fair AmbientsCommunication and mobility control in boxed ambientsOn an open problem of Amadio and Curien: The finite antichain conditionActive Evaluation Contexts for Reaction SemanticsTyping evolving ambientsOrderly communication in the ambient calculus.Behavioural typing for safe ambientsSecurity boundaries in mobile ambients