Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
A survey of rollback-recovery protocols in message-passing systems
ACM Computing Surveys (CSUR)
How to Commit Concurrent, Non-Isolated Computations
FTDCS '95 Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems
Communications of the ACM - Service-oriented computing
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Composable memory transactions
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
CONCUR 2005 - Concurrency Theory
Information and Computation
Services Mashups: The New Generation of Web Applications
IEEE Internet Computing
A Process Calculus Analysis of Compensations
Trustworthy Global Computing
A Process Calculus of Atomic Commit
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A concurrent calculus with atomic transactions
ESOP'07 Proceedings of the 16th European conference on Programming
Liveness of communicating transactions
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
A new strategy for distributed compensations with interruption in long-running transactions
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
First-Order dynamic logic for compensable processes
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Concurrent flexible reversibility
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
| Hi-index | 0.02 |
We propose a novel language construct called communicating transactions, obtained by dropping the isolation requirement from classical transactions, which can be used to model automatic error recovery in distributed systems. We extend CCS with this construct and give a simple semantics for the extended calculus, called TransCCS. We develop a behavioural theory which is sound and complete with respect to the may-testing preorder, and use it to prove interesting laws and reason compositionally about example systems. Finally, we prove that communicating transactions do not increase the observational power of processes; thus CCS equivalences are preserved in the extended language.