2010
Automated deadlock detection in synchronized reentrant multithreaded call-graphs
Publication
Publication
Presented at the
Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn
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.
| Additional Metadata | |
|---|---|
| Springer | |
| J. van Leeuwen (Jan) , A. Muscholl , D. Peleg , J. Pokorny , B. Rumpe | |
| Lecture Notes in Computer Science | |
| Modelling and Analysis of evolutionary structures for distributed services | |
| Conference on Current Trends in Theory and Practice of Computer Science | |
| Organisation | Computer Security |
|
Grabe, I., & de Boer, F. (2010). Automated deadlock detection in synchronized reentrant multithreaded call-graphs. In J. van Leeuwen, A. Muscholl, D. Peleg, J. Pokorny, & B. Rumpe (Eds.), Proceedings of 36th Conference on Current Trends in Theory and Practice of Computer Science 2010 (36) (pp. 200–211). Springer. |
|