Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Orchestrating Transactions in Join Calculus
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On Transaction Liveness in Replicated Databases
PRFTS '97 Proceedings of the 1997 Pacific Rim International Symposium on Fault-Tolerant Systems
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Process Calculus Analysis of Compensations
Trustworthy Global Computing
A concurrent calculus with atomic transactions
ESOP'07 Proceedings of the 16th European conference on Programming
Transactional service level agreement
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We study liveness and safety in the context of CCS extended with communicating transactions, a construct we recently proposed to model automatic error recovery in distributed systems. We show that fair-testing and may-testing capture the right notions of liveness and safety in this setting, and argue that must-testing imposes too strong a requirement in the presence of transactions. We develop a sound and complete theory of fair-testing in terms of CCS-like tree failures and show that, compared to CCS, communicating transactions provide increased distinguishing power to the observer. We also show that weak bisimilarity is a sound, though incomplete, proof technique for both may- and fair-testing. To the best of our knowledge this is the first semantic treatment of liveness in the presence of transactions. We exhibit the usefulness of our theory by proving illuminating liveness laws and simple but nontrivial examples.