{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:48:34Z","timestamp":1743036514179,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":2,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044199"},{"type":"electronic","value":"9783642044205"}],"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-04420-5_1","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T22:17:25Z","timestamp":1251325045000},"page":"1-2","source":"Crossref","is-referenced-by-count":2,"title":["On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems"],"prefix":"10.1007","author":[{"given":"Mohamed Faouzi","family":"Atig","sequence":"first","affiliation":[]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-00768-2_11","volume-title":"15th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2009)","author":"M.F. Atig","year":"2009","unstructured":"Atig, M.F., Bouajjani, A., Qadeer, S.: Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads. In: 15th Intern. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2009). LNCS, vol.\u00a05505, pp. 107\u2013123. Springer, Heidelberg (2009)"},{"key":"1_CR2","volume-title":"IARCS Ann. Intern. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), Leibniz Intern. Proc. in Informatics","author":"M.F. Atig","year":"2008","unstructured":"Atig, M.F., Bouajjani, A., Touili, T.: Analyzing Asynchronous Programs with Preemption. In: IARCS Ann. Intern. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), Leibniz Intern. Proc. in Informatics, vol.\u00a02. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04420-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:22:23Z","timestamp":1558268543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04420-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044199","9783642044205"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04420-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}