Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs

  • Frank S. de Boer
  • Immo Grabe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5901)

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

Personalised recommendations