Réversibilité dans le pi calcul d'ordre supérieur

Abstract : Reversible computing has a long history. Nowadays, reversible computing is attracting increasing interest because of its potential applications in diverse fields, including hardware design, biological modelling, program debugging and testing and quantum computing. Of particular interest is the application of reversible computation notions to the study of programming abstractions for dependable systems, because several techniques used to build dependable systems rely on some forms of undo or rollback. We continue, in this thesis, the study undertaken on reversible CCS by Vincent Danos and Jean Krivine, by defining a reversible higher-order pi-calculus (rhopi). We prove that reversibility in our calculus is causally consistent and that one can encode faithfully rhopi into a variant of HOpi. Moreover we design a fine-grained rollback primitive able to control the rollback of a concurrent execution. We give a formal specification of this primitive and show that it enjoys good properties, even in presence of concurrent conflicting rollbacks. We then devise a concurrent algorithm implementing such primitive and show that the algorithm respects the defined semantics.
Document type :
Complete list of metadatas

Cited literature [83 references]  Display  Hide  Download

Contributor : Abes Star <>
Submitted on : Friday, March 30, 2012 - 11:57:13 AM
Last modification on : Friday, June 22, 2018 - 1:19:42 AM
Long-term archiving on: Wednesday, December 14, 2016 - 6:31:39 PM


Version validated by the jury (STAR)


  • HAL Id : tel-00683964, version 1



Claudio Antares Mezzina. Réversibilité dans le pi calcul d'ordre supérieur. Autre [cs.OH]. Université de Grenoble, 2012. Français. ⟨NNT : 2012GRENM006⟩. ⟨tel-00683964⟩



Record views


Files downloads