ENSURING VALUE LIVENESS of DISTRIBUTED SOFTWARE THROUGH CHANGELING†

نویسندگان

  • Grace Tsai
  • Matt Insall
  • Bruce McMillin
چکیده

This paper extends the Changeling methodology, which ensures safety of concurrent and distributed software, to provide responsiveness properties. Changeling employs formal methods to generate executable assertions which ensure that the physical state, in the actual run time environment, is consistent with the logical state specified in the assertion. The focus, here, is on the generation of executable assertions from value liveliness properties established in the temporal specifications. Specifically, a translation process was developed to generate run-time-assured programs. The verification tool adopted by Changeling is Interleaving Set Temporal Logic (ISTL) since the logic is based on partial order semantics and capable of expressing the intermediate assertions(behavior) of distributed programs. The translation is shown to be sound and relatively complete; an example of ensuring value liveliness properties is presented for distributed Branch and Bound type problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Derivation of an Error-Detecting Distributed Data Scheduler Using Changeling

Distributed database applications are a wide use of distributed systems. One of the major advantages of distributed database systems is the potential for achieving high availability in the presence of faults. Faults must be handled so that the system still operates or operates in a degraded mode. This paper focuses on being able to detect component errors which can lead to system failures in th...

متن کامل

Compositional Synthesis of Distributed System Components based on Augmented marked Graphs

ABSTRACT Augmented marked graphs possess a special structure for modelling common resources as well as some desirable properties pertaining to liveness, boundedness, reversibility and conservativeness. This paper investigates the property-preserving composition of augmented marked graphs for the synthesis of distributed systems. It is proposed that distributed system components are specified as...

متن کامل

Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground

Self-stabilizing systems can be started in any arbitrary state and converge to exhibit the desired behavior. However, self-stabilizing systems can be started in predefined initial states, in the same way as non-stabilizing systems. In this case, a self-stabilizing system can mask faults just like any other distributed system. Moreover, whenever faults overwhelm the systems beyond their capabili...

متن کامل

Life, Death, and the Critical Transition: Finding Liveness Bugs in Systems Code

Modern software model checkers find safety violations: breaches where the system enters some bad state. However, we argue that checking liveness properties offers both a richer and more natural way to search for errors, particularly in complex concurrent and distributed systems. Liveness properties specify desirable system behaviors which must be satisfied eventually, but are not always satisfi...

متن کامل

Life, Death, and the Critical Transition: Finding Liveness Bugs in Systems Code (Awarded Best Paper)

Modern software model checkers find safety violations: breaches where the system enters some bad state. However, we argue that checking liveness properties offers both a richer and more natural way to search for errors, particularly in complex concurrent and distributed systems. Liveness properties specify desirable system behaviors which must be satisfied eventually, but are not always satisfi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001