@Article{Barbanera_etal2002,
author="Barbanera, Franco
and Dezani-Ciancaglini, Mariangiola
and Salvo, Ivano
and Sassone, Vladimiro",
title="A Type Inference Algorithm for Secure Ambients",
journal="Electronic Notes in Theoretical Computer Science",
year="2002",
publisher="Elsevier",
volume="62",
pages="83--101",
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.",
optnote="TOSCA 2001, Theory of Concurrency, Higher Order Languages and Types",
optnote="exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=73), last updated on Thu, 22 Nov 2012 14:59:18 +0100",
doi="10.1016/S1571-0661(04)00321-4",
opturl="https://doi.org/10.1016/S1571-0661(04)00321-4",
file=":http://mclab.di.uniroma1.it/publications/papers/papers/Barbanera2002.pdf:PDF"
}