Reversibility in the higher-order π-calculus

Abstract : The notion of reversible computation is attracting increasing interest because of its applications in diverse fields, in particular the study of programming abstractions for reliable systems. In this paper, we continue the study un-dertaken by Danos and Krivine on reversible CCS by defining a reversible higher-order π-calculus, called rhoπ. We prove that reversibility in our cal-culus is causally consistent and that the causal information used to support reversibility in rhoπ is consistent with the one used in the causal semantics of the π-calculus developed by Boreale and Sangiorgi. Finally, we show that one can faithfully encode rhoπ into a variant of higher-order π, substantially improving on the result we obtained in the conference version of this paper.
Liste complète des métadonnées

Littérature citée [72 références]  Voir  Masquer  Télécharger
Contributeur : Jean-Bernard Stefani <>
Soumis le : lundi 10 novembre 2014 - 16:13:12
Dernière modification le : jeudi 11 octobre 2018 - 08:48:04
Document(s) archivé(s) le : mercredi 11 février 2015 - 15:38:20


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01081714, version 1



Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard Stefani. Reversibility in the higher-order π-calculus. 2014. 〈hal-01081714〉



Consultations de la notice


Téléchargements de fichiers