May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects - Formal Techniques for Distributed Systems Access content directly
Conference Papers Year : 2013

May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects


We present a novel deadlock analysis for concurrent objects based on the results inferred by a points-to analysis and a may-happen-in-parallel (MHP) analysis. Similarly to other analysis, we build a dependency graph such that the absence of cycles in the graph ensures deadlock freeness. An MHP analysis provides an over-approximation of the pairs of program points that may be running in parallel. The crux of the method is that the analysis integrates the MHP information within the dependency graph in order to discard unfeasible cycles that otherwise would lead to false positives. We argue that our analysis is more precise and/or efficient than previous proposals for deadlock analysis of concurrent objects. As regards accuracy, we are able to handle cases that other analyses have pointed out as challenges. As regards efficiency, the complexity of our deadlock analysis is polynomial.
Fichier principal
Vignette du fichier
978-3-642-38592-6_19_Chapter.pdf (399.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01515247 , version 1 (27-04-2017)





Antonio E. Flores-Montoya, Elvira Albert, Samir Genaim. May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects. 15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2013, Florence, Italy. pp.273-288, ⟨10.1007/978-3-642-38592-6_19⟩. ⟨hal-01515247⟩
102 View
126 Download



Gmail Facebook X LinkedIn More