Mobile Processes and Termination

Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensure termination of the process computations. Two approaches are exposed. The rst one draws on the method of logical relations, which has been extensively used in the analysis of sequential languages. The second approach exploits notions from term rewriting.

• Type: Conference
• Year: 2009
• Where: BIRTHDAY
• Authors: Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi
• Keywords: Applied Computing, Approach Exploits Notions, BIRTHDAY 2009, Concurrent Setting, Ensure Termination