Pages that link to "Item:Q5178864"
From MaRDI portal
The following pages link to Controlling interference in ambients (Q5178864):
Displaying 30 items.
- Space-aware ambients and processes (Q875514) (← links)
- Fair ambients (Q877172) (← links)
- An efficient abstract machine for safe ambients (Q882488) (← links)
- Theory of interaction (Q896903) (← links)
- Access control in mobile ambient calculi: a comparative view (Q930876) (← links)
- Role-based access control for boxed ambients (Q930879) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Mobility control via passports (Q1012123) (← links)
- Flow-sensitive type systems and the ambient calculus (Q1029816) (← links)
- Typing evolving ambients (Q1607130) (← links)
- A coordination approach to mobile components (Q1770368) (← links)
- When ambients cannot be opened (Q1770415) (← links)
- Orderly communication in the ambient calculus. (Q1869977) (← links)
- Behavioural typing for safe ambients (Q1869978) (← links)
- Security boundaries in mobile ambients (Q1869979) (← links)
- On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
- Nesting analysis of mobile ambients (Q1886451) (← links)
- On abstract interpretation of mobile ambients (Q1887169) (← links)
- A typed encoding of boxed into safe ambients (Q2491209) (← links)
- Types for the ambient calculus (Q2497144) (← links)
- The seal calculus (Q2566220) (← links)
- Communication and mobility control in boxed ambients (Q2573334) (← links)
- On an open problem of Amadio and Curien: The finite antichain condition (Q2573335) (← links)
- A Type Inference Algorithm for Secure Ambients (Q2841272) (← links)
- (Q2844039) (← links)
- Active Evaluation Contexts for Reaction Semantics (Q2866316) (← links)
- On the Expressiveness of the π-Calculus and the Mobile Ambients (Q3067465) (← links)
- On the Expressiveness of Pure Mobile Ambients (Q4917029) (← links)
- 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 (Q4917051) (← links)
- Applying a testing approach to the Calculus of Fair Ambients (Q5850754) (← links)
