A Type Inference Algorithm for Secure Ambients
Barbanera, F., Dezani, M., Salvo, I. and Sassone, V. (2001) A Type Inference Algorithm for Secure Ambients. In, Theory of Concurrency, Higher Order and Types, TOSCA Workshop 2001. Elsevier, 19 pp.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (243Kb) |
Description/Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Keywords: | security levels, access control, ambient calculus, types |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science |
| Item ID: | 262286 |
| Date Deposited: | 11 Apr 2006 |
| Last Modified: | 10 Mar 2012 11:13 |
| Contributors: | Barbanera, F. (Author) Dezani, M. (Author) Salvo, I. (Author) Sassone, V. (Author) |
| Date: | 2001 |
| Status: | Published |
| Publisher: | Elsevier |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/262286 |
Actions (login required)
 |
View Item |
