We present a bottom-up type inference algorithm for security types in Mobile Ambients. The algorithm, given an untyped process $P$, calculates the minimal set of constraints on security levels such that all the actions during a run of $P$ can be performed without violating the security level priorities. Our algorithm appears as a preliminary step in order to use type systems to ensure security properties in the web scenario.
A Type Inference Algorithm for Secure Ambients / F., Barbanera; M., Dezani; Salvo, Ivano; V., Sassone. - In: ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE. - ISSN 1571-0661. - ELETTRONICO. - ENTCS 62:(2001), pp. 83-101. (Intervento presentato al convegno Theory of Concurrency, Higher Order Languages and Types tenutosi a Udine (Italy) nel November 19-21, 2001) [10.1016/S1571-0661(04)00321-4].
A Type Inference Algorithm for Secure Ambients
SALVO, Ivano;
2001
Abstract
We present a bottom-up type inference algorithm for security types in Mobile Ambients. The algorithm, given an untyped process $P$, calculates the minimal set of constraints on security levels such that all the actions during a run of $P$ can be performed without violating the security level priorities. Our algorithm appears as a preliminary step in order to use type systems to ensure security properties in the web scenario.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
