Compliance for reversible client/server interactions
Abstract
In the setting of session behaviours, we study an extension of the concept of compliance when a disciplined form of backtracking is present. After adding checkpoints to the syntax of session behaviours, we formalise the operational semantics via a LTS, and define a natural notion of checkpoint compliance. We then obtain a co-inductive characterisation of such compliance relation, and an axiomatic presentation that is proved to be sound and complete. As a byproduct we get a decision procedure for the new compliance, being the axiomatic system algorithmic.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2014
- DOI:
- 10.48550/arXiv.1408.5981
- arXiv:
- arXiv:1408.5981
- Bibcode:
- 2014arXiv1408.5981B
- Keywords:
-
- Computer Science - Logic in Computer Science
- E-Print:
- In Proceedings BEAT 2014, arXiv:1408.5564