Fundamentals of algebraic specification 2: module specifications and constraints
Fundamentals of algebraic specification 2: module specifications and constraints
Non-blocking atomic commitment
Distributed systems (2nd Ed.)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
On Simplifying Modular Specification and Verification of Distributed Protocols
HASE '01 The 6th IEEE International Symposium on High-Assurance Systems Engineering: Special Topic: Impact of Networking
Specware: Formal Support for Composing Software
MPC '95 Mathematics of Program Construction
Consensus service: a modular approach for building agreement protocols in distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
The Decentralized Non-Blocking Atomic Commitment Protocol
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Mechanical Verification of Transaction Processing Systems
ICFEM '00 Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A Formal Model of Crash Recovery in a Distributed System
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Establishing the correctness of reliable distributed protocolssupporting critical applications necessitates modular/compositional approaches to tackle the inherent complexityof these protocols. Efforts involved in the specificationand verification of these reliable distributed protocolscan be considerably reduced if the protocol is composed utilizingsmaller components (building-blocks) possessing individualfunctionalities that are integral parts of the overallprotocol operation. In this paper we present the modularcomposition of a transaction processing protocol, namelythe three-phase commit (3PC) protocol utilizing concepts ofcategory theory. Specifically, we illustrate how the overallglobal properties of the protocol can be proved by utilizingconstructs of local sub-properties of the inherent buildingblocks of the 3PC protocol.