Barbanera, F., Dezani, M., Salvo, I. and Sassone, V.
A Type Inference Algorithm for Secure Ambients
At Theory of Concurrency, Higher Order and Types, TOSCA Workshop 2001..
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottom-up algorithm that, given an untyped process $P$, computes a minimal set of constraints on security levels such that all actions during runs of $P$ are performed without violating the security level priorities. Such an algorithm appears to be a prerequisite to use type systems to ensure security properties in the web scenario.
Conference or Workshop Item
|Venue - Dates:
||Theory of Concurrency, Higher Order and Types, TOSCA Workshop 2001., 2001-01-01
||security levels, access control, ambient calculus, types
||Web & Internet Science
||11 Apr 2006
||17 Apr 2017 21:43
|Further Information:||Google Scholar|
Actions (login required)