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.
Totality, definability and boolean circuits / Antonio, Bucciarelli; Salvo, Ivano. - STAMPA. - 1443:(1998), pp. 808-819. (Intervento presentato al convegno Automata, Languages and Programming, 25th International Colloquium tenutosi a Aalborg, Danemark nel July 13-17, 1998) [10.1007/BFb0055104].
Totality, definability and boolean circuits
SALVO, Ivano
1998
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.
