Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
نویسندگان
چکیده
This paper presents an algorithm for detecting deadlocks in concurrent finite-state systems without incurring most of the state explosion due to the modeling of concurrency by interleaving. For systems that have a high level of concurrency our algorithm can be much more efficient than the classical exploration of the whole state space. Finally, we show that our algorithm can also be used for verifying arbitrary safety properties.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملEfficient Verification of Halting Properties for MPI Programs with Wildcard Receives
We are concerned with the verification of certain properties, such as freedom from deadlock, for parallel programs that are written using the Message Passing Interface (MPI). It is known that for MPI programs containing no “wildcard receives” (and restricted to a certain subset of MPI) freedom from deadlock can be established by considering only synchronous executions. We generalize this by pre...
متن کاملUsing Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom
We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. While there are multiple definitions of deadlock in the literature, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a systemwide deadlock (s...
متن کاملTheorem 3 . 1 . For any property P , SPL ( P )
Informally, a safety property stipulates that some ' bad thing' does not happen during execution [1]. Examples of safety properties include mutual exclusion, deadlock freedom, and partial correctness. In mutual exclusion, the proscribed ' bad thing' is two processes executing in critical sections at the same time. In deadlock freedom, it is deadlock. In partial correctness, it is terminating in...
متن کاملOn improving simultaneous reachability analysis for the efficient verification of deadlock-freedom
In [11], simultaneous reachability analysis is proposed as a relief strategy for the verification of progress properties of bounded protocols. A bounded protocol i s defined as a network of n ≥ 2 finite-state processes communicating over bounded, error-free simplex channels. This paper presents an enhancement of simultaneous reachability analysis which yields a significant reduction of the stor...
متن کامل