Skip to main content

Run-Time Deadlock Detection

  • Chapter
  • First Online:
  • 547 Accesses

Part of the book series: NASA Monographs in Systems and Software Engineering ((NASA))

Abstract

This chapter reports research that is partly funded by the EU project FP7-610582 Envisage. It describes a method for detecting at run-time deadlock in both multi-threaded Java programs and systems of concurrent objects. The method is based on attribute grammars for specifying properties of message sequences. For multi-threaded Java programs we focus on the actual tool-development which extends the run-time checking of assertions. For concurrent objects which communicate via asynchronous message passing and synchronize on futures which store the return values, we present the underlying theory and sketch its implementation.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    Here CFL stands for “Context Free Language”.

  2. 2.

    Due to re-entrance, locks in Java can be acquired more than once by the same thread.

References

  1. de Boer, F.S., de Gouw, S., Johnsen, E.B., Kohn, A., Wong, P.Y.H.: Run-time assertion checking of data- and protocol-oriented properties of java programs: an industrial case study. Trans. Aspect-Oriented Softw. Dev. 11, 1–26 (2014)

    Google Scholar 

  2. Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theory 2(2), 127–145 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  3. de Boer, F.S., de Gouw, S.: Run-time checking multi-threaded java programs. In: 42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM. Lecture Notes in Computer Science (2016)

    Google Scholar 

  4. Johnsen, E.B., Hähnle, R., Schäfer, J., Schlatte, R., Steffen, M.: ABS: a core language for abstract behavioral specification. In: Aichernig, B., de Boer, F.S., Bonsangue, M.M. (eds.) Proceedings of 9th International Symposium on Formal Methods for Components and Objects (FMCO 2010). LNCS, vol. 6957, pp. 142–164. Springer, Heidelberg (2011)

    Google Scholar 

  5. de Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: Proceedings of Programming Languages and Systems, 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, 24 March–1 April 2007, pp. 316–330 (2007)

    Google Scholar 

  6. 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 J. Res. Dev. 54(5), 3 (2010)

    Article  Google Scholar 

  7. de Boer, F.S., Grabe, I.: Automated deadlock detection in synchronized reentrant multithreaded call-graphs. In: Proceedings of SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, 23–29 January 2010, pp. 200–211 (2010)

    Google Scholar 

  8. Gawlitza, T.M., Lammich, P., Müller-Olm, M., Seidl, H., Wenner, A.: Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation. In: Proceedings of Verification, Model Checking, and Abstract Interpretation - 12th International Conference, VMCAI 2011, Austin, TX, USA, 23–25 January 2011, pp. 199–213 (2011)

    Google Scholar 

  9. de Boer, F.S., Bravetti, M., Grabe, I., Lee, M.D., Steffen, M., Zavattaro, G.: A petri net based analysis of deadlocks for active objects and futures. In: Formal Aspects of Component Software, 9th International Symposium, FACS 2012, Mountain View, CA, USA, 12–14 September 2012. Revised Selected Papers, pp. 110–127 (2012)

    Google Scholar 

  10. Giachino, E., Grazia, C.A., Laneve, C., Lienhardt, M., Wong, P.Y.H.: Deadlock analysis of concurrent objects: Theory and practice. In: Proceedings of Integrated Formal Methods, 10th International Conference, IFM 2013, Turku, Finland, 10–14 June 2013, pp. 394–411 (2013)

    Google Scholar 

  11. Giachino, E., Laneve, C.: Analysis of deadlocks in object groups. In: Proceedings of Formal Techniques for Distributed Systems - Joint 13th IFIP WG 6.1 International Conference, FMOODS 2011, and 31st IFIP WG 6.1 International Conference, FORTE 2011, Reykjavik, Iceland, 6–9 June 2011, pp. 168–182 (2011)

    Google Scholar 

  12. Parr, T.: The Definitive ANTLR Reference. Pragmatic Bookshelf (2007)

    Google Scholar 

Download references

Acknowledgements

We thank the anonymous reviewers for their most constructive and helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank S. de Boer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

de Boer, F.S., de Gouw, S. (2017). Run-Time Deadlock Detection. In: Hinchey, M., Bowen, J., Olderog, ER. (eds) Provably Correct Systems. NASA Monographs in Systems and Software Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-48628-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48628-4_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48627-7

  • Online ISBN: 978-3-319-48628-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics