Termination in Impure Concurrent Languages

Romain Demangeon 1 Daniel Hirschkoff 1 Davide Sangiorgi 2, 3
1 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it possible to combine term rewriting measure-based techniques with traditional approaches for termination in functional languages such as logical relations. The method can be made parametric on the termination technique employed on the functional part; it can also be iterated. We illustrate the method in the case of a π-calculus with both functional and imperative names, and show that, with respect to previous approaches to termination, it allows us to extend considerably the set of processes that can be handled. The method can also be applied to sequential languages, e.g., λ-calculi with references
Document type :
Conference papers
Complete list of metadatas

Contributor : Daniel Hirschkoff <>
Submitted on : Sunday, March 10, 2013 - 5:26:07 PM
Last modification on : Wednesday, October 3, 2018 - 11:44:26 AM

Links full text




Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi. Termination in Impure Concurrent Languages. CONCUR'10, 2010, Paris, France. pp.328-342, ⟨10.1007/978-3-642-15375-4_23⟩. ⟨hal-00798789⟩



Record views