Skip to main navigation Skip to search Skip to main content

Concurrent reversible sessions

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a calculus for concurrent reversible multiparty sessions, which improves on recent proposals in several respects: it allows for concurrent and sequential composition within processes and types, it gives a compact representation of the past of processes and types, which facilitates the definition of rollback, and it implements a fine-tuned strategy for backward computation. We propose a refined session type system for our calculus and show that it enforces the expected properties of session fidelity, forward and backward progress, as well as causal consistency. In conclusion, our calculus is a conservative extension of previous proposals, offering enhanced expressive power and refined analysis techniques.

Original languageEnglish
Title of host publication28th International Conference on Concurrency Theory, CONCUR 2017
EditorsRoland Meyer, Uwe Nestmann
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770484
DOIs
Publication statusPublished - 1 Aug 2017
Event28th International Conference on Concurrency Theory, CONCUR 2017 - Berlin, Germany
Duration: 5 Sept 20178 Sept 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume85
ISSN (Print)1868-8969

Conference

Conference28th International Conference on Concurrency Theory, CONCUR 2017
Country/TerritoryGermany
CityBerlin
Period5/09/178/09/17

Keywords

  • Communication-centric Systems
  • Multiparty Session Types
  • Process Calculi
  • Reversible Computation

Fingerprint

Dive into the research topics of 'Concurrent reversible sessions'. Together they form a unique fingerprint.

Cite this