A Beginner’s Guide to the DeadLock Analysis Model

  • Elena Giachino
  • Cosimo Laneve
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8191)


This paper is an introduction to the framework for the deadlock analysis of object-oriented languages we have defined in [6,5]. We present a basic Java-like language and the deadlock analysis model in an accessible way. We also overview the algorithm for deciding deadlock-freeness by discussing a number of paradigmatic examples. We finally explore the techniques for coping with extensions of the object-oriented language.


Static deadlock analyzers object-oriented languages circular dependencies lam livelocks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agarwal, R., Bensalem, S., Farchi, E., Havelund, K., Nir-Buchbinder, Y., Stoller, S.D., Ur, S., Wang, L.: Detection of deadlock potentials in multithreaded programs. IBM Journal of Research and Development 54(5), 3 (2010)Google Scholar
  2. 2.
    Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe program: preventing data races and deadlocks. In: Proc. OOPSLA 2002, pp. 211–230. ACM (2002)Google Scholar
  3. 3.
    Comtet, L.: Advanced Combinatorics: The Art of Finite and Infinite Expansions, Dordrecht, Netherlands (1974)Google Scholar
  4. 4.
    Giachino, E., Grazia, C.A., Laneve, C., Lienhardt, M., Wong, P.Y.H.: Deadlock analysis in practice (submitted, 2013),
  5. 5.
    Giachino, E., Laneve, C.: Deadlock and livelock analysis in concurrent objects with futures, Technical Report (2013),
  6. 6.
    Giachino, E., Laneve, C.: Mutations, flashbacks and deadlocks (submitted, 2013),
  7. 7.
    Giachino, E., Lascu, T.A.: Lock analysis for an asynchronous object calculus. In: ICTCS 2012 (2012)Google Scholar
  8. 8.
    Johnsen, E.B., Hähnle, R., Schäfer, J., Schlatte, R., Steffen, M.: ABS: A core language for abstract behavioral specification. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol. 6957, pp. 142–164. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Kobayashi, N.: Type systems for concurrent programs. In: Aichernig, B.K., Maibaum, T. (eds.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 439–453. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233–247. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, ii. Inf. and Comput. 100, 41–77 (1992)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Elena Giachino
    • 1
    • 2
  • Cosimo Laneve
    • 1
    • 2
  1. 1.Dipartimento di InformaticaUniversità di BolognaItaly
  2. 2.INRIA Focus TeamFrance

Personalised recommendations