A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Fundamentals of algebraic specification 2: module specifications and constraints
Fundamentals of algebraic specification 2: module specifications and constraints
Category theory for computing science
Category theory for computing science
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Basic category theory for computer scientists
Basic category theory for computer scientists
Component Based Design of Multitolerant Systems
IEEE Transactions on Software Engineering
Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance
IEEE Transactions on Software Engineering
Software fault tolerance techniques and implementation
Software fault tolerance techniques and implementation
IEEE Software
Specware: Formal Support for Composing Software
MPC '95 Mathematics of Program Construction
Verification of fault tolerance and real time
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
| Hi-index | 0.01 |
With the recent advancements in component-based software engineering, there is an increasing trend in developing applications for highly reliable and critical systems using pre-validated and reusable software components. As these applications are inherently complex and component-interactions are not straightforward, there is an immediate need for a methodology that could aid in composition of these reusable components ensuring the correctness of the composed software system. In this paper, we illustrate how the concepts of category theory can be utilized to develop component-based fault-tolerant software systems that encompass software components capable of tolerating particular types of faults. Our proposed framework for the development of a composite fault-tolerant program and verification of its overall correctness has been realized through a mechanized formal tool.