Recovery Oriented Programming

Brukman, Olga

doi:10.1007/978-3-540-49823-0_11

Cited by 8 publications

(3 citation statements)

References 16 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

Self Cite

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

Self Cite

View full text Add to dashboard Cite

show abstract

“…The Producer-Consumer task that uses the pseudocode presented in Figures 4, 5, The code produced by our framework for the producer-consumer task is self-stabilizing only if the uniqueness of the object hash codes is guaranteed. Otherwise, the produced code is pseudo self-stabilizing [9] with regards to the safety property as explained in [3].…”

Section: Producer-consumer Examplementioning

confidence: 99%

Recovery oriented programming

Brukman

Sihman

2005

Proceedings of the Twentieth ACM Symposium on Operating Systems Principles

Self Cite

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

“…Runtime verification of asynchronous systems for ensuring safety and liveness specifications by monitoring events has been discussed in e.g., Dolev & Stomp (2003); Brukman & Dolev (2006) ;Brukman, Dolev & Kolodner (2008) ;. A parametric real-time monitoring system with multiple logical structures is proposed in Jin et al (2012).…”

Section: Introductionmentioning

confidence: 99%

Efficient online detection of temporal patterns

Goldfeld

Puzis

Venkateswarlu

2016

PeerJ Computer Science

Self Cite

View full text Add to dashboard Cite

Identifying a temporal pattern of events is a fundamental task of online (realtime) verification. We present efficient schemes for online monitoring of events for identifying desired/undesired patterns of events. The schemes use preprocessing to ensure that the number of comparisons during run-time is minimized. In particular, the first comparison following the time point when an execution sub-sequence cannot be further extended to satisfy the temporal requirements halts the process that monitors the sub-sequence. Subjects Algorithms and Analysis of Algorithms, Theory and Formal Methods

show abstract

Recovery Oriented Programming

Cited by 8 publications

References 16 publications

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

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

Recovery oriented programming

Efficient online detection of temporal patterns

Contact Info

Product

Resources

About