Contextual Locking for Dynamic Pushdown Networks
Contextual locking is a scheme for synchronizing between possibly recursive processes that has been proposed by Chadha et al. recently. Contextual locking allows for arbitrary usage of locks within the same procedure call and Chadha et al. show that control-point reachability for two processes adhering to contextual locking is decidable in polynomial time. Here, we complement these results. We show that in presence of contextual locking, control-point reachability becomes PSPACE-hard, already if the number of processes is increased to three. On the other hand, we show that PSPACE is both necessary and sufficient for deciding control-point reachability of k processes for k > 2, and that this upper bound remains valid even if dynamic spawning of new processes is allowed. Furthermore, we consider the problem of regular reachability, i.e., whether a configuration within a given regular set can be reached. Here, we show that this problem is decidable for recursive processes with dynamic thread creation and contextual locking. Finally, we generalize this result to processes that additionally use a form of join operations.
Unable to display preview. Download preview PDF.
- 1.Bonnet, R., Chadha, R.: Bounded context-switching and reentrant locking. In: Pfenning, F. (ed.) FOSSACS 2013. LNCS, vol. 7794, pp. 65–80. Springer, Heidelberg (2013)Google Scholar
- 5.Esparza, J., Ganty, P.: Complexity of pattern-based verification for multithreaded programs. In: POPL, pp. 499–510. ACM (2011)Google Scholar
- 8.Kahlon, V.: Boundedness vs. unboundedness of lock chains: Characterizing decidability of pairwise cfl-reachability for threads communicating via locks. In: LICS, pp. 27–36. IEEE Computer Society (2009)Google Scholar
- 12.Lammich, P.: Lock-Sensitive Analysis of Parallel Programs. Ph.D. thesis, WWU Münster (June 2011)Google Scholar
- 15.Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Ph.D. thesis, TU München (April 1998)Google Scholar