Self-stabilizing autonomic recoverer for eventual Byzantine software

Brukman, Olga; Kolodner, Elliot K.

doi:10.1109/swste.2003.1245312

Cited by 15 publications

(17 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm is presented in Figure 4. The plant state reflection and dynamic plant replication capabilities allows us to learn the connected component of s p−curr in the most efficient manner by experimentation on the plant replicas: we record the visited plant states and prune search paths that reach already visited states (lines [1][2][3][4][5][6][7][8][9][10][11][12][13][14]. Note that the algorithm explores all outgoing edges of each state s i reachable from s p−curr exactly once.…”

Section: Algorithm I (Static Replication From Current State No Reflementioning

confidence: 99%

Self-* programming: run-time parallel control search for reflection box

2013

View full text Add to dashboard Cite

Abstract. Real life situations may require an automatic fast update of the control of a plant, whether the plant is an airplane that needs to overcome an emergency situation due to drastic environment change, or a process that needs to continue executing an application in spite of a change in an operating system behavior. Settings for run-time control synthesis are defined, assuming the environment maybe totally dynamic, but is reentrant and history oblivious for long enough periods. A reentrant environment allows several copies of a plant to interact with the environment independently; a history oblivious environment ensures a repetition (in the probabilistic case with the same probability) of an interaction starting with a plant in a certain state and replaying its output to the environment. Total dynamic changes of the environment do not allow a definition of weakly realizable specifications, as weakly realizable specifications depend on the environment behavior. On line experiments of the environment assists in the implementation of unrealizable specifications; Automatically checking whether the unrealizable specifications define weakly realizable specifications, given the behavior restriction of the current environment. A successful search for a control implicitly identifies the weakly realizable specifications, and explicitly the implementation that respect the specifications. Different settings and capabilities of the plant are investigated. In particular, (i) plant state reflection that allows observation of the current state of the plant, (ii) plant state set that generalizes the reset capability, allowing setting the plant to each of its states, and (iii) (static or dynamic) plant replication that allows instantiation of plant replicas or use of preexisting plant replicas for parallelizing testing algorithms. The algorithms presented prove that the above capabilities enable a polynomial search for a new control upon a drastic change of the environment.

show abstract

Section: Algorithm I (Static Replication From Current State No Reflementioning

confidence: 99%

Self-* programming: run-time parallel control search for reflection box

2013

View full text Add to dashboard Cite

show abstract

“…The existence of the external monitor threads and their scheduling is ensured by a self-stabilizing OS [11] and by the framework of the self-stabilizing autonomic recoverer [4]. The external monitor of the subsystem repeatedly checks the subsystem recovery tuples.…”

Section: Recovery Oriented Programmingmentioning

confidence: 99%

“…The consumer thread (sub 2 ) and the queue object (sub 3 ) form subsystem sub 5 . The subsystem sub 4 and sub 5 form the subsystem sub 6 . The subsystems configuration graph G for the system is presented in Figure 3.…”

Section: Producer-consumer Examplementioning

confidence: 99%

“…Still, in many cases the program specifications are not fulfilled [19] -a situation that can cause a great deal of damage. In our previous work on selfstabilizing autonomic recoverer [4], we suggested a formal framework for the recovery oriented paradigm [20]. The suggested approach fitted existing (black box) software packages, which resulted in high overhead, as each IO action had to be intercepted to detect a faulty state.…”

Section: Introductionmentioning

confidence: 99%

“…Both predicates and recovery actions will be an integral part of the program specification. In this scope we are interested in a new programming paradigm that complements the case of black box software packages (addressed in [4]). …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Recovery oriented programming

Brukman

Sihman

2005

Proceedings of the Twentieth ACM Symposium on Operating Systems Principles

View full text Add to dashboard Cite

Abstract. Writing a perfectly correct code is a challenging and a nearly impossible task. In this work we suggest the recovery oriented programming paradigm in order to cope with eventual Byzantine programs. The program specification composer enforces the program specifications (both the safety and the liveness properties) in run time using predicates over input and output variables. The component programmer will use these variables in the program implementation. We suggest using the "sand-box" approach in which every instruction of the program that changes a specification variable, is executed first with temporary variables and that is in order to avoid execution of an instruction that violates the specifications. In addition, external monitoring is used for coping with transient faults and for ensuring convergence to a legal state. The implementation of these ideas includes the definition of new instructions in the programming language with the purpose of allowing addition of predicates and recovery actions. We suggest a design for a tool that extends the Java programming language. In addition to that, we provide a correctness proof scheme for proving that the code combined with the predicates and the recovery actions is self-stabilizing and, under the restartability assumption, eventually fulfills its specifications.

show abstract

Self-stabilization Preserving Compiler

Haviv

Sagiv

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Self-stabilizing autonomic recoverer for eventual Byzantine software

Cited by 15 publications

References 14 publications

Self-* programming: run-time parallel control search for reflection box

Self-* programming: run-time parallel control search for reflection box

Recovery oriented programming

Self-stabilization Preserving Compiler

Contact Info

Product

Resources

About