Diconic addition of failsafe fault-tolerance
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Challenges in transformation of existing real-time embedded systems to cyber-physical systems
ACM SIGBED Review - Special issue on the RTSS forum on deeply embedded real-time computing
Masking Faults While Providing Bounded-Time Phased Recovery
FM '08 Proceedings of the 15th international symposium on Formal Methods
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Complexity results in revising UNITY programs
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Revising Distributed UNITY Programs Is NP-Complete
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Automating the addition of fault tolerance with discrete controller synthesis
Formal Methods in System Design
Weakest Invariant Generation for Automated Addition of Fault-Tolerance
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Automated composition of Web services via planning in asynchronous domains
Artificial Intelligence
Distributed synthesis of fault-tolerant programs in the high atomicity model
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Complexity issues in automated model revision without explicit legitimate state
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Automated addition of fault recovery to cyber-physical component-based models
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Application of automated revision for UML models: a case study
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Facilitating the design of fault tolerance in transaction level systemc programs
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Validating time-constrained systems using UML statecharts patterns and timed automata observers
VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems
Automated model repair for distributed programs
ACM SIGACT News
A Lightweight Method for Automated Design of Convergence in Network Protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
MR4UM: A framework for adding fault tolerance to UML state diagrams
Theoretical Computer Science
Facilitating the design of fault tolerance in transaction level SystemC programs
Theoretical Computer Science
| Hi-index | 0.00 |
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complexity known as the state explosion problem. Symbolic techniques, in which elements of a problem are represented by Boolean formulae, are desirable in the sense that they often remedy the state explosion problem and time complexity of decision procedures. Although symbolic techniques have successfully been used in program verification, their benefits have not yet been exploited in the context of program synthesis and transformation extensively. In this paper, we present a symbolic method for automatic synthesis of fault-tolerant distributed programs. Our experimental results on synthesis of classical fault-tolerant distributed problems such as Byzantine agreement and token ring show a significant performance improvement by several orders of magnitude in both time and space complexity. To the best of our knowledge, this is the first illustration where programs with large state space (beyond 2100) is handled during synthesis.