{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:04:50Z","timestamp":1760645090907},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_36","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:54:50Z","timestamp":1127814890000},"page":"473-487","source":"Crossref","is-referenced-by-count":81,"title":["Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[]},{"given":"Markus","family":"M\u00fcller-Olm","sequence":"additional","affiliation":[]},{"given":"Tayssir","family":"Touili","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Baeten, J., Weijland, W.: Process algebra. Cambridge Tracts in Theoretical Computer Science, vol.\u00a018 (1990)","DOI":"10.1017\/CBO9780511624193"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 1997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243. Springer, Heidelberg (1997)"},{"key":"36_CR3","volume-title":"POPL 2003","author":"A. Bouajjani","year":"2003","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL 2003. ACM, New York (2003)"},{"key":"36_CR4","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: Reachability Analysis of Synchronised PA systems. In: INFINITY 2004 (2004) (to appear in ENTCS)"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., M\u00fcller-Olm, M., Touili, T.: Regular Symbolic Analysis of Dynamic Networks of Pushdown Processes. Technical report, LIAFA lab No 2005-05, and University of Dortmund No 798 (June 2005)","DOI":"10.1007\/11539452_36"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-24597-1_7","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Bouajjani","year":"2003","unstructured":"Bouajjani, A., Touili, T.: Reachability Analysis of Process Rewrite Systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 74\u201387. Springer, Heidelberg (2003)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-32033-3_35","volume-title":"Term Rewriting and Applications","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., Touili, T.: On Computing Reachability Sets of Process Rewrite Systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 484\u2013499. Springer, Heidelberg (2005)"},{"key":"36_CR8","unstructured":"Bruggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Research report (2001)"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-49019-1_2","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural data-flow analysis. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 14\u201330. Springer, Heidelberg (1999)"},{"key":"36_CR10","volume-title":"POPL 2000","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Podelski, A.: Efficient algorithms for pre\u2009\u2217\u2009 and post\u2009\u2217\u2009 on interprocedural parallel flow graphs. In: POPL 2000. ACM, New York (2000)"},{"key":"36_CR11","volume-title":"Infinity 1997, ENTCS 9","author":"A. Finkel","year":"1997","unstructured":"Finkel, A., Willems, B., Wolper, P.: A Direct Symbolic Approach to Model Checking Pushdown Systems. In: Infinity 1997, ENTCS 9. Elsevier Sci. Pub., Amsterdam (1997)"},{"issue":"1-2","key":"36_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0304-3975(00)00306-6","volume":"274","author":"D. Lugiez","year":"2002","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on PA-processes. Theoretical Computer Science\u00a0274(1-2), 89\u2013115 (2002)","journal-title":"Theoretical Computer Science"},{"key":"36_CR13","unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Phd. thesis, Technical University Munich (1998)"},{"key":"36_CR14","unstructured":"M\u00fcller-Olm, M.: Variations on Constants. Habilitationsschrift, Fachbereich Informatik, Universit\u00e4t Dortmund (2002)"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2003.09.002","volume":"311","author":"M. M\u00fcller-Olm","year":"2004","unstructured":"M\u00fcller-Olm, M.: Precise interprocedural dependence analysis of parallel programs. Theoretical Computer Science\u00a0311, 325\u2013388 (2004)","journal-title":"Theoretical Computer Science"},{"key":"36_CR16","unstructured":"Qadeer, S., Rajamani, S., Rehof, J.: Procedure Summaries for Model Checking Multithreaded Software. In: POPL 2004 (2004)"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-31980-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-Bounded Model-Checking of Concurrent Software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 93\u2013107. Springer, Heidelberg (2005)"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46425-5_23","volume-title":"Programming Languages and Systems","author":"H. Seidl","year":"2000","unstructured":"Seidl, H., Steffen, B.: Constraint-based inter-procedural analysis of parallel programs. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, p. 351. Springer, Heidelberg (2000)"},{"key":"36_CR19","unstructured":"Touili, T.: Dealing with communication for dynamic multithreaded recursive programs. In: 1st VISSAS workshop (March 2005) (invited Paper)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T18:43:08Z","timestamp":1586457788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11539452_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}