Reversible client/server interactions

Barbanera, Franco; Dezani‐Ciancaglini, Mariangiola; de’Liguoro, Ugo

doi:10.1007/s00165-016-0358-2

Cited by 11 publications

(8 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This rule is non-deterministic in the choice of messages. The condition msg(Λ) ⊆ msg(Λ ) (borrowed from [4,5]) assures that the sender can freely choose the message, since the receiver must offer all sender messages and possibly more. This allows us to distinguish in the operational semantics between internal and external choices.…”

Section: Definition 23 (Lts For Multiparty Sessionsmentioning

confidence: 99%

Composition and decomposition of multiparty sessions

Barbanera

Dezani‐Ciancaglini

Lanese

et al. 2021

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Multiparty sessions are systems of concurrent processes, which allow several participants to communicate by sending and receiving messages. Their overall behaviour can be described by means of global types. Typable multiparty sessions enjoy lock-freedom.We look at multiparty sessions as open systems by allowing one to compose multiparty sessions by transforming two of their participants into a pair of coupled gateways, forwarding messages between the two sessions. Gateways need to be compatible. We show that the session resulting from the composition can be typed, and its type can be computed from the global types of the starting sessions. As a consequence, lock-freedom is preserved by composition. Compatibility between global types is necessary, since systems obtained by composing sessions with incompatible global types have locks (or they are not sessions). We also define direct composition, which allows one to connect two global types without using gateways. Finally, we propose a decomposition operator, to split a global type into two, which is the left inverse of direct composition. Direct composition and decomposition on global types prepare the ground for a novel framework allowing for the modular design and implementation of distributed systems.

show abstract

Section: Definition 23 (Lts For Multiparty Sessionsmentioning

confidence: 99%

Composition and decomposition of multiparty sessions

Barbanera

Dezani‐Ciancaglini

Lanese

et al. 2021

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…(Binary) contracts are a behavioural model [77] to study the interactions between a client and a server. The first investigation of contracts in a reversible setting appeared in [21,22]. There, both the client and the server could rollback to a previous checkpoint at any moment.…”

Section: Analysis Techniquesmentioning

confidence: 99%

Foundations of Reversible Computation

Aman

Ciobanu

Glück

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled "Reversible Computation-Extending Horizons of Computing", which took place in the years 2015-2019.

show abstract

“…Another closely related work is [33,34], where a different form of contracts with rollback is presented. Our retractable contracts depart from that model on three main aspects: (1) we use rollback in a disciplined way to tolerate failures in the interaction, thus making it easier for contracts to be compliant, while in [33,34] the decision to rollback is internal to each participant, and the partner needs to be compliant with both forward behavior and all the behaviors emerging from each possible rollback; (2) we embed checkpoints in the structure of contracts, avoiding explicit checkpoints;…”

Section: Related Work and Conclusionmentioning

confidence: 99%

A theory of retractable and speculative contracts

Barbanera

Lanese

de’Liguoro

2018

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

Behavioral contracts are abstract descriptions of expected communication patterns followed by either clients or servers during their interaction. Behavioral contracts come naturally equipped with a notion of compliance: when a client and a server follow compliant contracts, their interaction is guaranteed to progress or successfully complete. We study two extensions of behavioral contracts, retractable contracts dealing with backtracking and speculative contracts dealing with speculative execution. We show that the two extensions give rise to the same notion of compliance. As a consequence, they also give rise to the same subcontract relation, which determines when one server can be replaced by another preserving compliance. Moreover, compliance and subcontract relation are both decidable in quadratic time. Finally, we study the relationship between retractable contracts and calculi for reversible computing.

show abstract

Reversible client/server interactions

Cited by 11 publications

References 27 publications

Composition and decomposition of multiparty sessions

Composition and decomposition of multiparty sessions

Foundations of Reversible Computation

A theory of retractable and speculative contracts

Contact Info

Product

Resources

About