Time: Wednesday 8.3.2006, 14:30
Place: Room B2-109, Fr. Bajersvej 7
This talk presents an extension of Hennessy et al. Dpi-calculus with constructs for signing and authenticating code and for sandboxing. A sort system, built on Milner's sort systems for the polyadic pi-calculus, is presented and proven sound with respect to an error predicate which ensures that errors do not occur outside sandboxes and that authentication and migration only happen when allowed. Futhermore a weak subject reduction result involving partial well sortedness is presented.