Chapter

SOFSEM 2010: Theory and Practice of Computer Science

Volume 5901 of the series Lecture Notes in Computer Science pp 200-211

Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs

  • Frank S. de BoerAffiliated withCWI
  • , Immo GrabeAffiliated withCWIChristian-Albrechts-University Kiel

* Final gross prices may vary according to local VAT.

Get Access

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.