منابع مشابه
‘Recognizing Safety and Liveness’ by Alpern and Schneider
What is liveness? “Good things do happen” Or at least will happen eventually. There is not a timing constraint in this model. For example, consider the following “live event”: Nuclear Winter. Sure bad things happen, but it has been an inspiration for much art so something good about it has happened. Liveness is usually related to well-foundedness. In logic, well-foundedness means that for a bin...
متن کاملLiveness Checking as Safety Checking
Temporal logic is widely used for specifying hardware and software systems. Typically two types of properties are distinguished, safety and liveness properties. While safety can easily be checked by reachability analysis, and many efficient checkers for safety properties exist, more sophisticated algorithms have always been considered to be necessary for checking liveness. In this paper we desc...
متن کاملSafety and Liveness in Branching Time
We extend the Alpern and Schneider linear time characterization of safety and liveness properties to branching time, where properties are sets of trees. We define two closure operators that give rise to the following four extremal types of properties: universally safe, existentially safe, universally live, and existentially live. The distinction between universal and existential properties capt...
متن کاملLiveness and Safety in Concurrent Constraint Programs
In this section we recall the standard de nitions of temporal operators in the notation of Clarke s CTL The operators are used to specify liveness properties something good will nally happen and safety properties nothing bad will happen In non deterministic systems one has to make precise whether the speci cation refers to some or to all execution sequences starting from a given state Let S T b...
متن کاملSafety and Liveness in Concurrent Pointer Programs
The incorrect use of pointers is one of the most common source of software errors. Concurrency has a similar characteristic. Proving the correctness of concurrent pointer manipulating programs, let alone algorithmically, is a highly non-trivial task. This paper proposes an automated verification technique for concurrent programs that manipulate linked lists. Key issues of our approach are: auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 1987
ISSN: 0178-2770,1432-0452
DOI: 10.1007/bf01782772