Detecting Deadlocks in Concurrent Systems
نویسندگان
چکیده
We use a geometric description for deadlocks occuring in scheduling problems for concurrent systems to construct a partial order and hence a directed graph, in which the local maxima correspond to deadlocks. Algorithms finding deadlocks are described and assessed.
منابع مشابه
Run - Time Analysis for Atomicity 1
Writing and debugging concurrent (shared-variable) programs is notoriously difficult. This motivated the development of numerous static analysis and run-time analysis techniques designed to (help) ensure that concurrent programs satisfy common correctness requirements for concurrent programs, such as absence of race conditions and absence of deadlocks. This paper focuses on another common corre...
متن کاملSymbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs
It is well accepted that designing and analyzing concurrent software-components are tedious tasks. Assuring the quality of such software requires formal methods, which can statically detect deadlocks. This paper presents a symbolic data ow analysis framework for detecting deadlocks in Ada programs with tasks. The symbolic data ow framework is based on symbolic evaluation { an advanced technique...
متن کاملDeadlock Analysis in Statecharts
A method is proposed for detecting all reachable deadlocks in a discrete system specified by Statecharts. The detecting is performed by means of building and analyzing the reduced reachability graphs of the system or its parts. The method can be applied to formal verification of the concurrent logical control algorithms described in this language.
متن کاملDetecting Potential Deadlocks with Static Analysis and Run-Time Monitoring
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when a set of threads is blocked each trying to acquire a lock held by another thread in that set. Static and dynamic (run-time) analysis techniques exist to detect deadlocks. Havelund’s GoodLock algorithm detects potential deadlocks ...
متن کاملResolution of Deadlocks in Object-Oriented Distributed Systems
The use of locks on objects to enforce correct scheduling of concurrent transactions gives rise to deadlock situations. We propose and prove correct a distributed algorithm for detection and resolutions of resource deadlocks in object-oriented distributed systems. In particular, the algorithm can be used in conjunction with concurrency control algorithms which are based on the semantic lock mod...
متن کامل