{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:15Z","timestamp":1725600315136},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_15","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"132-144","source":"Crossref","is-referenced-by-count":6,"title":["Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Aiswarya","family":"Cyriac","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Arenas, M., Barcel\u00f3, P., Etessami, K., Immerman, N., Libkin, L.: First-order and temporal logics for nested words. Log. Meth. Comput. Sci.\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:11)2008"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24730-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 467\u2013481. Springer, Heidelberg (2004)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R. Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. Journal of the ACM\u00a056, 16:1\u201316:43 (2009)","journal-title":"Journal of the ACM"},{"key":"15_CR4","unstructured":"Atig, M.F.: Global Model Checking of Ordered Multi-Pushdown Systems. In: FSTTCS 2010, vol.\u00a08, pp. 216\u2013227 (2010)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-00596-1_29","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Bollig","year":"2009","unstructured":"Bollig, B., Grindei, M.-L., Habermehl, P.: Realizability of concurrent recursive programs. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 410\u2013424. Springer, Heidelberg (2009)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03793-1_2","volume-title":"Database Programming Languages","author":"D. Calvanese","year":"2009","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: An Automata-Theoretic Approach to Regular XPath. In: Gardner, P., Geerts, F. (eds.) DBPL 2009. LNCS, vol.\u00a05708, pp. 18\u201335. Springer, Heidelberg (2009)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Logic of Programs, pp. 52\u201371 (1981)","DOI":"10.1007\/BFb0025774"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-19805-2_12","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Dax","year":"2011","unstructured":"Dax, C., Klaedtke, F.: Alternation elimination for automata over nested words. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 168\u2013183. Springer, Heidelberg (2011)"},{"issue":"11","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1016\/j.ic.2006.07.002","volume":"204","author":"V. Diekert","year":"2006","unstructured":"Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Information and Computation\u00a0204(11), 1597\u20131619 (2006)","journal-title":"Information and Computation"},{"volume-title":"The Book of Traces","year":"1995","key":"15_CR10","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-45187-7_15","volume-title":"CONCUR 2003 - Concurrency Theory","author":"P. Gastin","year":"2003","unstructured":"Gastin, P., Kuske, D.: Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 222\u2013236. Springer, Heidelberg (2003)"},{"issue":"7","key":"15_CR13","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. Information and Computation\u00a0208(7), 797\u2013816 (2010)","journal-title":"Information and Computation"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.2178\/jsl\/1231082313","volume":"74","author":"S. G\u00f6ller","year":"2009","unstructured":"G\u00f6ller, S., Lohrey, M., Lutz, C.: PDL with intersection and converse: satisfiability and infinite-state model checking. J. Symb. Log.\u00a074(1), 279\u2013314 (2009)","journal-title":"J. Symb. Log."},{"key":"15_CR15","first-page":"161","volume-title":"LICS 2007","author":"S. La Torre","year":"2007","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS 2007, pp. 161\u2013170. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"5","key":"15_CR16","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.2178\/jsl\/1129642115","volume":"70","author":"M. Lange","year":"2005","unstructured":"Lange, M., Lutz, C.: 2-ExpTime lower bounds for Propositional Dynamic Logics with Intersection. J. Symb. Log.\u00a070(5), 1072\u20131086 (2005)","journal-title":"J. Symb. Log."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Libkin, L.: Logics for Unranked Trees: An Overview. Log. Meth. Comput. Sci.\u00a02(3) (2006)","DOI":"10.2168\/LMCS-2(3:2)2006"},{"key":"15_CR18","first-page":"46","volume-title":"Proceedings of FOCS 1977","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of FOCS 1977, pp. 46\u201357. IEEE, Los Alamitos (1977)"},{"key":"15_CR19","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":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-15648-8_31","volume-title":"Logics of Programs","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: The taming of converse: Reasoning about two-way computations. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 413\u2013423. Springer, Heidelberg (1985)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:12:49Z","timestamp":1558311169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}