{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T18:26:10Z","timestamp":1743877570871,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_22","type":"book-chapter","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:53:30Z","timestamp":1494629610000},"page":"288-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reachability Analysis of Dynamic Pushdown Networks with Priorities"],"prefix":"10.1007","author":[{"given":"Marcio","family":"Diaz","sequence":"first","affiliation":[]},{"given":"Tayssir","family":"Touili","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/11539452_36","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A Bouajjani","year":"2005","unstructured":"Bouajjani, A., M\u00fcller-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\u2013487. Springer, Heidelberg (2005). doi:\n                      10.1007\/11539452_36"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-16164-3_18","volume-title":"Model Checking Software","author":"N Kidd","year":"2010","unstructured":"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\u2013261. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-16164-3_18"},{"key":"22_CR3","unstructured":"Atig, M.F., Bouajjani, A., Touili, T.: Analyzing asynchronous programs with preemption. In: FSTTCS, pp. 37\u201348 (2008)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Goller, S., Lin, A.W.: The complexity of verifying ground tree rewrite systems. In: LICS, pp. 279\u2013288 (2011)","DOI":"10.1109\/LICS.2011.36"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput. 156(1), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"22_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0890-5401(90)90059-Q","volume":"87","author":"R Cleaveland","year":"1990","unstructured":"Cleaveland, R., Hennessy, M.: Priorities in process algebras. Inf. Comput. 87(1\u20132), 58\u201377 (1990)","journal-title":"Inf. Comput."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-18275-4_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"TM Gawlitza","year":"2011","unstructured":"Gawlitza, T.M., Lammich, P., M\u00fcller-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\u2013213. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-18275-4_15"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Wenner, A.: Weighted dynamic pushdown networks. In: Programming Languages and Systems, pp. 590\u2013609 (2010)","DOI":"10.1007\/978-3-642-11957-6_31"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-02658-4_39","volume-title":"Computer Aided Verification","author":"P Lammich","year":"2009","unstructured":"Lammich, P., M\u00fcller-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\u2013539. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-02658-4_39"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11590156_28","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"A Bouajjani","year":"2005","unstructured":"Bouajjani, A., Esparza, J., Schwoon, S., Strej\u010dek, J.: Reachability analysis of multithreaded software with asynchronous communication. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 348\u2013359. Springer, Heidelberg (2005). doi:\n                      10.1007\/11590156_28"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-74407-8_20","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"P Lammich","year":"2007","unstructured":"Lammich, P., M\u00fcller-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\u2013302. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-74407-8_20"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-04420-5_13","volume-title":"Reachability Problems","author":"D Lugiez","year":"2009","unstructured":"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\u2013140. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-04420-5_13"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:18:22Z","timestamp":1558318702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}