{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:44Z","timestamp":1725798644676},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_37","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"438-450","source":"Crossref","is-referenced-by-count":2,"title":["Model Checking Concurrent Recursive Programs Using Temporal Logics"],"prefix":"10.1007","author":[{"given":"Roy","family":"Mennicke","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-33386-6_13","volume-title":"Automated Technology for Verification and Analysis","author":"M.F. Atig","year":"2012","unstructured":"Atig, M.F., Bouajjani, A., Narayan Kumar, K., Saivasan, P.: Linear-time model-checking for multithreaded programs under scope-bounding. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol.\u00a07561, pp. 152\u2013166. Springer, Heidelberg (2012)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-38771-5_7","volume-title":"Developments in Language Theory","author":"M.F. Atig","year":"2013","unstructured":"Atig, M.F., Narayan Kumar, K., Saivasan, P.: Adjacent ordered multi-pushdown systems. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 58\u201369. Springer, Heidelberg (2013)"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-38536-0_35","volume-title":"Computer Science \u2013 Theory and Applications","author":"K. Bansal","year":"2013","unstructured":"Bansal, K., Demri, S.: Model-checking bounded multi-pushdown systems. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol.\u00a07913, pp. 405\u2013417. Springer, Heidelberg (2013)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Bollig, B., Kuske, D., Mennicke, R.: The complexity of model checking multi-stack systems. In: LICS, pp. 163\u2013172. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.22"},{"issue":"3","key":"37_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1142\/S0129054196000191","volume":"7","author":"L. Breveglieri","year":"1996","unstructured":"Breveglieri, L., Cherubini, A., Citrini, C., Crespi-Reghizzi, S.: Multi-push-down languages and grammars. Int. J. Found. Comput. Sci.\u00a07(3), 253\u2013292 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"37_CR6","unstructured":"Cyriac, A.: Verification of Communicating Recursive Programs via Split-width. PhD thesis, ENS Cachan (2014)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-642-32940-1_38","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"A. Cyriac","year":"2012","unstructured":"Cyriac, A., Gastin, P., Kumar, K.N.: MSO decidability of multi-pushdown systems via split-width. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 547\u2013561. Springer, Heidelberg (2012)"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects, vol.\u00a01. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537694.003.0001"},{"issue":"1-3","key":"37_CR9","first-page":"169","volume":"80","author":"P. Gastin","year":"2007","unstructured":"Gastin, P., Kuske, D.: Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces. Fundam. Inform.\u00a080(1-3), 169\u2013197 (2007)","journal-title":"Fundam. Inform."},{"issue":"7","key":"37_CR10","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ic.2009.12.003","volume":"208","author":"P. Gastin","year":"2010","unstructured":"Gastin, P., Kuske, D.: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Inf. Comput.\u00a0208(7), 797\u2013816 (2010)","journal-title":"Inf. Comput."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161\u2013170. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.9"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-23217-6_14","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"S. La Torre","year":"2011","unstructured":"La Torre, S., Napoli, M.: Reachability of multistack pushdown systems with scope-bounded matching relations. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 203\u2013218. Springer, Heidelberg (2011)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-33475-7_16","volume-title":"Theoretical Computer Science","author":"S. La Torre","year":"2012","unstructured":"La Torre, S., Napoli, M.: A temporal logic for multi-threaded programs. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol.\u00a07604, pp. 225\u2013239. Springer, Heidelberg (2012)"},{"key":"37_CR14","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)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T06:17:41Z","timestamp":1717222661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}