Automated deadlock detection in synchronized reentrant multithreaded call-graphs
- Grabe, Immo
- Boer, Frank
- Leeuwen, Jan
- Muscholl, A.
- Peleg, D.
- Pokorny, J.
- Rumpe, B.
Publication date
January 2010
DOI Publisher
Springer Fachmedien Wiesbaden GmbH ISSN
0302-9743 Citation count (estimate)
3Abstract
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
Add to ORKG