%0 Journal Article
%T A Type Inference Algorithm for Secure Ambients
%A Barbanera, Franco
%A Dezani-Ciancaglini, Mariangiola
%A Salvo, Ivano
%A Sassone, Vladimiro
%J Electronic Notes in Theoretical Computer Science
%D 2002
%V 62
%I Elsevier
%F Barbanera_etal2002
%O TOSCA 2001, Theory of Concurrency, Higher Order Languages and Types
%O exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=73), last updated on Thu, 22 Nov 2012 14:59:18 +0100
%X 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.
%R 10.1016/S1571-0661(04)00321-4
%U http://mclab.di.uniroma1.it/publications/papers/papers/Barbanera2002.pdf
%U https://doi.org/10.1016/S1571-0661(04)00321-4
%P 83-101