Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model

Bonakdarpour, Borzoo; Kulkarni, Sandeep S.; Abujarad, Fuad

doi:10.1007/978-3-540-76627-8_5

Cited by 3 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specifically, these include (1) algorithms for adding failsafe and masking fault-tolerance, to existing fault-intolerant centralized programs whose state space is distributed on a network or cluster of workstations [20], (2) algorithms for deadlock resolution in distributed models [1], and (3) algorithms for parallelizing constraint-based addition of fault-tolerance to distributed models [2].…”

Section: Fault-tolerancementioning

confidence: 99%

Automated model repair for distributed programs

Bonakdarpour

Kulkarni

2012

SIGACT News

Self Cite

View full text Add to dashboard Cite

Model repair is a formal method that aims at fixing bugs in models automatically. Typically, these models are finite state automata that can be compactly represented using guarded commands or variations thereof. The bugs in these models can be identified using traditional techniques, such as verification, testing, or runtime monitoring. However, these techniques do not assist in fixing bugs automatically. The goal in model repair is to automatically transform an input model into another model that satisfies additional properties (e.g., a property that the original model fails to satisfy). Moreover, such transformation should preserve the existing specification of the input model. In this article, we review the efforts in the past decade on developing model repair algorithms in different domains. These domains include distributed computing, fault-tolerance and self-stabilization, and real-time systems. We present the results on complexity analysis, techniques for tackling intractability of the problem and scalability, and related tools. The techniques and tools discussed in this article demonstrate the feasibility of automated synthesis of well-known protocols such as Byzantine agreement, token ring, fault-tolerant mutual exclusion, etc.

show abstract

Section: Fault-tolerancementioning

confidence: 99%

Automated model repair for distributed programs

Bonakdarpour

Kulkarni

2012

SIGACT News

Self Cite

View full text Add to dashboard Cite

show abstract

Synthesis of Fault-Tolerant Distributed Systems

Dimitrova

Finkbeiner

2009

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. A distributed system is fault-tolerant if it continues to perform correctly even when a subset of the processes becomes faulty. Faulttolerance is highly desirable but often difficult to implement. In this paper, we investigate fault-tolerant synthesis, i.e., the problem of determining whether a given temporal specification can be implemented as a fault-tolerant distributed system. As in standard distributed synthesis, we assume that the specification of the correct behaviors is given as a temporal formula over the externally visible variables. Additionally, we introduce the fault-tolerance specification, a CTL * formula describing the effects and the duration of faults. If, at some point in time, a process becomes faulty, it becomes part of the external environment and its further behavior is only restricted by the fault-tolerance specification. This allows us to model a large variety of fault types. Our method accounts for the effect of faults on the values communicated by the processes, and, hence, on the information available to the non-faulty processes. We prove that for fully connected system architectures, i.e., for systems where each pair of processes is connected by a communication link, the fault-tolerant synthesis problem from CTL * specifications is 2EXPTIME-complete.

show abstract

Synthesizing bounded-time 2-phase fault recovery

Bonakdarpour

Kulkarni

2015

Form. Asp. Comput.

View full text Add to dashboard Cite

We focus on synthesis techniques for transforming existing fault-intolerant real-time programs into fault-tolerant programs that provide phased recovery . A fault-tolerant program is one that satisfies its safety and liveness specifications as well as timing constraints in the presence of faults. We argue that in many commonly considered programs (especially in safety/mission-critical systems), when faults occur, simple recovery to the program’s normal behavior is necessary, but not sufficient. For such programs, it is necessary that recovery is accomplished in a sequence of phases, each ensuring that the program satisfies certain properties. In the simplest case, in the first phase the program recovers to an acceptable behavior within some time θ , and, in the second phase, it recovers to the ideal behavior within time δ . In this article, we introduce four different types of bounded-time 2-phase recovery, namely ordered-strict, strict, relaxed, and graceful, based on how a real-time fault-tolerant program reaches the acceptable and ideal behaviors in the presence of faults. We rigorously analyze the complexity of automated synthesis of each type: we either show that the problem is hard in some class of complexity or we present a sound and complete synthesis algorithm. We argue that such complexity analysis is essential to deal with the highly complex decision procedures of program synthesis.

show abstract

Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model

Cited by 3 publications

References 18 publications

Automated model repair for distributed programs

Automated model repair for distributed programs

Synthesis of Fault-Tolerant Distributed Systems

Synthesizing bounded-time 2-phase fault recovery

Contact Info

Product

Resources

About