The following pages link to (Q5714432):
Displaying 20 items.
- Fair ambients (Q877172) (← links)
- An efficient abstract machine for safe ambients (Q882488) (← links)
- Access control in mobile ambient calculi: a comparative view (Q930876) (← links)
- Using bisimulation proof techniques for the analysis of distributed abstract machines (Q935472) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Flow-sensitive type systems and the ambient calculus (Q1029816) (← links)
- A coordination approach to mobile components (Q1770368) (← links)
- When ambients cannot be opened (Q1770415) (← links)
- Security boundaries in mobile ambients (Q1869979) (← links)
- On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- Information flow security in boundary ambients (Q2482455) (← links)
- A typed encoding of boxed into safe ambients (Q2491209) (← 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)
- An overview of boxed ambients (abstract) (Q2841270) (← links)
- A type inference algorithm for secure ambients (Q2841272) (← links)
- A chart semantics for the pi-calculus (Q2864369) (← links)
- Secure Data Flow in a Calculus for Context Awareness (Q3507380) (← links)
