{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:39Z","timestamp":1725536019080},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034657"},{"type":"electronic","value":"9783642034664"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03466-4_20","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T03:20:54Z","timestamp":1249269654000},"page":"307-321","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Reachability of Process Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Tayssir","family":"Touili","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-85361-9_29","volume-title":"CONCUR 2008 - Concurrency Theory","author":"M.F. Atig","year":"2008","unstructured":"Atig, M.F., Bouajjani, A., Touili, T.: On the reachability analysis of acyclic networks of pushdown systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 356\u2013371. Springer, Heidelberg (2008)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL, pp. 62\u201373 (2003)","DOI":"10.1145\/604131.604137"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.entcs.2005.02.063","volume":"138","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: Reachability analysis of synchronized pa systems. Electr. Notes Theor. Comput. Sci.\u00a0138(3), 153\u2013178 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"20_CR4","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., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 473\u2013487. Springer, Heidelberg (2005)"},{"key":"20_CR5","volume-title":"LICS","author":"A. Bouajjani","year":"2001","unstructured":"Bouajjani, A., Muscholl, A., Touili, T.: Permutation Rewriting and Algorithmic Verification. In: LICS. IEEE, Los Alamitos (2001)"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ic.2005.11.007","volume":"205","author":"A. Bouajjani","year":"2007","unstructured":"Bouajjani, A., Muscholl, A., Touili, T.: Permutation rewriting and algorithmic verification. Inf. Comput.\u00a0205(2), 199\u2013224 (2007)","journal-title":"Inf. Comput."},{"key":"20_CR7","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":"20_CR8","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":"20_CR9","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"20_CR10","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":"20_CR11","doi-asserted-by":"crossref","unstructured":"Gilleron, R., Deruyver, A.: The reachability problem for ground TRS and some extensions. In: TAPSOFT, pp. 227\u2013243 (1989)","DOI":"10.1007\/3-540-50939-9_135"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45007-6_4","volume-title":"Developments in Language Theory","author":"A.C. G\u00f3mez","year":"2003","unstructured":"G\u00f3mez, A.C., Pin, J.-E.: On a conjecture of schnoebelen. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 35\u201354. Springer, Heidelberg (2003)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0055615","volume-title":"CONCUR \u201998 Concurrency Theory","author":"D. Lugiez","year":"1998","unstructured":"Lugiez, D., Schnoebelen, P.: The regular viewpoint on PA-processes. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 50\u201366. Springer, Heidelberg (1998)"},{"key":"20_CR14","unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Phd. thesis, Munich University (1998)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-73368-3_28","volume-title":"Computer Aided Verification","author":"G. Patin","year":"2007","unstructured":"Patin, G., Sighireanu, M., Touili, T.: Spade: Verification of multithreaded dynamic and recursive programs. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 254\u2013257. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.scico.2005.02.009","volume":"58","author":"T.W. Reps","year":"2005","unstructured":"Reps, T.W., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program.\u00a058(1-2), 206\u2013263 (2005)","journal-title":"Sci. Comput. Program."},{"key":"20_CR17","first-page":"283","volume":"67","author":"P. Schnoebelen","year":"1999","unstructured":"Schnoebelen, P.: Decomposable regular languages and the shuffle operator. EATCS Bull\u00a067, 283\u2013289 (1999)","journal-title":"EATCS Bull"},{"key":"20_CR18","unstructured":"Touili, T.: Dealing with communication for dynamic multithreaded recursive programs. In: VISSAS, pp. 213\u2013227 (2005)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03466-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:36:07Z","timestamp":1558456567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03466-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034657","9783642034664"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03466-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}