International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 2010: SOFSEM 2010: Theory and Practice of Computer Science pp 200-211

Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs

  • Frank S. de Boer
  • Immo Grabe
Conference paper

DOI: 10.1007/978-3-642-11266-9_17

Volume 5901 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
de Boer F.S., Grabe I. (2010) Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs. In: van Leeuwen J., Muscholl A., Peleg D., Pokorný J., Rumpe B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg

Abstract

In this paper we investigate the synchronization of multithreaded call graphs with reentrance similar to call graphs in Java programs. We model the individual threads as Visibly Pushdown Automata (VPA) and analyse the reachability of a state in the product automaton by means of a Context Free Language (CFL) which captures the synchronized interleaving of threads. We apply this CFL-reachability analysis to detect deadlock.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Frank S. de Boer
    • 1
  • Immo Grabe
    • 1
    • 2
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.Christian-Albrechts-University KielGermany