Thursday, 19 August 2010, 14:00
Cybernetica Bldg (Akadeemia tee 21), room B101
Slides from the talk [pdf]
Abstract: Ensuring termination is a challenging task in a concurrent setting where the topology of the systems can evolve dynamically (creation of new services, update of existing services, sharing of previously secret informations). We study the termination of the mobile processes in the formalism of the pi-calculi using static analysis such as type systems. We use methods coming both from the rewriting theory and the proof theory and present an original way of combining the two approaches, yielding increased expressiveness.