Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
- 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
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.
Unable to display preview. Download preview PDF.