Abstract
In this paper, we consider the reachability problem of multi-threaded programs where threads have priorities and are scheduled by a priority based round-robin scheduler. For that, we introduce a new model, called Dynamic Pushdown Networks with Priorities (P-DPNs) that extends the well known DPN model with priorities. We represent potentially infinite sets of configurations of P-DPNs using finite state automata and show that the backward reachability sets of P-DPNs are regular and can be effectively computed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bouajjani, A., Müller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 473–487. Springer, Heidelberg (2005). doi:10.1007/11539452_36
Kidd, N., Jagannathan, S., Vitek, J.: One stack to run them all. In: Pol, J., Weber, M. (eds.) SPIN 2010. LNCS, vol. 6349, pp. 245–261. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16164-3_18
Atig, M.F., Bouajjani, A., Touili, T.: Analyzing asynchronous programs with preemption. In: FSTTCS, pp. 37–48 (2008)
Goller, S., Lin, A.W.: The complexity of verifying ground tree rewrite systems. In: LICS, pp. 279–288 (2011)
Mayr, R.: Process rewrite systems. Inf. Comput. 156(1), 264–286 (2000)
Cleaveland, R., Hennessy, M.: Priorities in process algebras. Inf. Comput. 87(1–2), 58–77 (1990)
Gawlitza, T.M., Lammich, P., Müller-Olm, M., Seidl, H., Wenner, A.: Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 199–213. Springer, Heidelberg (2011). doi:10.1007/978-3-642-18275-4_15
Wenner, A.: Weighted dynamic pushdown networks. In: Programming Languages and Systems, pp. 590–609 (2010)
Lammich, P., Müller-Olm, M., Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 525–539. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02658-4_39
Bouajjani, A., Esparza, J., Schwoon, S., Strejček, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 348–359. Springer, Heidelberg (2005). doi:10.1007/11590156_28
Lammich, P., Müller-Olm, M.: Precise fixpoint-based analysis of programs with thread-creation and procedures. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 287–302. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74407-8_20
Lugiez, D.: Forward analysis of dynamic network of pushdown systems is easier without order. In: Bournez, O., Potapov, I. (eds.) RP 2009. LNCS, vol. 5797, pp. 127–140. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04420-5_13
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Diaz, M., Touili, T. (2017). Reachability Analysis of Dynamic Pushdown Networks with Priorities. In: El Abbadi, A., Garbinato, B. (eds) Networked Systems. NETYS 2017. Lecture Notes in Computer Science(), vol 10299. Springer, Cham. https://doi.org/10.1007/978-3-319-59647-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-59647-1_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59646-4
Online ISBN: 978-3-319-59647-1
eBook Packages: Computer ScienceComputer Science (R0)