Skip to main content
SpringerLink
Log in

Deadlock Analysis of Unbounded Process Networks

  • Conference paper
CONCUR 2014 – Concurrency Theory (CONCUR 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8704))

Included in the following conference series:

Abstract

Deadlock detection in concurrent programs that create networks with arbitrary numbers of nodes is extremely complex and solutions either give imprecise answers or do not scale. To enable the analysis of such programs, (1) we define an algorithm for detecting deadlocks of a basic model featuring recursion and fresh name generation: the lam programs, and (2) we design a type system for value passing CCS that returns lam programs. As a byproduct of these two techniques, we have an algorithm that is more powerful than previous ones and that can be easily integrated in the current release of TyPiCal, a type-based analyser for pi-calculus.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., Flanagan, C., Freund, S.N.: Types for safe locking: Static race detection for Java. TOPLAS 28 (2006)

    Google Scholar 

  2. Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe program.: preventing data races and deadlocks. In: OOPSLA, pp. 211–230. ACM (2002)

    Google Scholar 

  3. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press (2002)

    Google Scholar 

  4. Flanagan, C., Qadeer, S.: A type and effect system for atomicity. In: PLDI, pp. 338–349. ACM (2003)

    Google Scholar 

  5. Giachino, E., Laneve, C.: A beginner’s guide to the deadlock analysis model. In: Palamidessi, C., Ryan, M.D. (eds.) TGC 2012. LNCS, vol. 8191, pp. 49–63. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  6. Giachino, E., Laneve, C.: Deadlock detection in linear recursive programs. In: Bernardo, M., Damiani, F., Hähnle, R., Johnsen, E.B., Schaefer, I. (eds.) SFM 2014. LNCS, vol. 8483, pp. 26–64. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  7. Giachino, E., Laneve, C., Lienhardt, M.: A framework for deadlock detection in ABS. In: Software and System Modeling (to appear, 2014)

    Google Scholar 

  8. Kobayashi, N.: A type system for lock-free processes. Information and Computation 177, 122–159 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kobayashi, N.: Type systems for concurrent programs. In: Aichernig, B.K. (ed.) Formal Methods at the Crossroads. From Panacea to Foundational Support. LNCS, vol. 2757, pp. 439–453. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informatica 42(4-5), 291–347 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Kobayashi, N.: TyPiCal: Type-based static analyzer for the Pi-Calculus (2007), http://www-kb.is.s.u-tokyo.ac.jp/~koba/typical/

  13. Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems 21(5), 914–947 (1999)

    Article  Google Scholar 

  14. Kobayashi, N., Sangiorgi, D.: A hybrid type system for lock-freedom of mobile processes. ACM TOPLAS 32(5) (2010)

    Google Scholar 

  15. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Book  Google Scholar 

  16. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, ii. Inf. and Comput. 100, 41–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Padovani, L.: Deadlock and Lock Freedom in the Linear π-Calculus. In: CSL-LICS 2014 (2014)

    Google Scholar 

  18. Suenaga, K.: Type-based deadlock-freedom verification for non-block-structured lock primitives and mutable references. In: Ramalingam, G. (ed.) APLAS 2008. LNCS, vol. 5356, pp. 155–170. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Vasconcelos, V.T., Martins, F., Cogumbreiro, T.: Type inference for deadlock detection in a multithreaded polymorphic typed assembly language. In: PLACES. EPTCS, vol. 17, pp. 95–109 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Egineering, University of Bologna – INRIA FOCUS, Italy

    Elena Giachino & Cosimo Laneve

  2. Dept. of Computer Science, University of Tokyo, Japan

    Naoki Kobayashi

Authors
  1. Elena Giachino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naoki Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cosimo Laneve
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Padova, Via Trieste, 63, 35121, Padova, Italy

    Paolo Baldan

  2. Department of Computer Science, University of Roma “La Sapienza”, Via Salaria, 113, 00198, Rome, Italy

    Daniele Gorla

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giachino, E., Kobayashi, N., Laneve, C. (2014). Deadlock Analysis of Unbounded Process Networks. In: Baldan, P., Gorla, D. (eds) CONCUR 2014 – Concurrency Theory. CONCUR 2014. Lecture Notes in Computer Science, vol 8704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44584-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44584-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44583-9

  • Online ISBN: 978-3-662-44584-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation