%0 Conference Proceedings
%T May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects
%+ Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt)
%+ Universidad Complutense de Madrid =  Complutense University of Madrid  [Madrid] (UCM)
%A Flores-Montoya, Antonio, E.
%A Albert, Elvira
%A Genaim, Samir
%Z Part 8: Session 7: Distribution and Concurrency
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 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)
%C Florence, Italy
%Y Dirk Beyer
%Y Michele Boreale
%I Springer
%3 Formal Techniques for Distributed Systems
%V LNCS-7892
%P 273-288
%8 2013-06-03
%D 2013
%R 10.1007/978-3-642-38592-6_19
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01515247/document
%2 https://inria.hal.science/hal-01515247/file/978-3-642-38592-6_19_Chapter.pdf
%L hal-01515247
%U https://inria.hal.science/hal-01515247
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-7892