This paper surveys some recent works on the study of termination in a concurrent setting. Processes are $pi$-calculus processes, on which type systems are imposed that ensure termination of the process computations. Two approaches are exposed. The first 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.
Mobile Processes and Termination / R. Demangeon; D. Hirschkoff; D. Sangiorgi. - STAMPA. - 5700:(2009), pp. 250-273. (Intervento presentato al convegno Semantics and Algebraic Specification, Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday tenutosi a Udine nel Settembre 7-10, 2009).
Mobile Processes and Termination
SANGIORGI, DAVIDE
2009
Abstract
This paper surveys some recent works on the study of termination in a concurrent setting. Processes are $pi$-calculus processes, on which type systems are imposed that ensure termination of the process computations. Two approaches are exposed. The first 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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
