{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:54Z","timestamp":1725544074113},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330455"},{"type":"electronic","value":"9783540330462"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11690634_20","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T09:15:28Z","timestamp":1143537328000},"page":"292-306","source":"Crossref","is-referenced-by-count":5,"title":["Propositional Dynamic Logic with Recursive Programs"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Serre","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Chaudhuri, S., Madhusudan, P.: A fixpoint calculus for local and global program flows. In: Proceedings of POPL 2006 (to appear 2006)","DOI":"10.1145\/1111037.1111051"},{"key":"20_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":"20_CR3","first-page":"202","volume-title":"Proceedings of STOC 2004","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of STOC 2004, pp. 202\u2013211. ACM, New York (2004)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-16066-3_5","volume-title":"Computation Theory","author":"R. Danecki","year":"1985","unstructured":"Danecki, R.: Nondeterministic propositional dynamic logic with intersection is decidable. In: Skowron, A. (ed.) SCT 1984. LNCS, vol.\u00a0208, pp. 34\u201353. Springer, Heidelberg (1985)"},{"issue":"2","key":"20_CR5","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 dyncamic logic of regular programs. Journal of Computer and System Sciences\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR6","unstructured":"Harel, D., Kaminsky, M.: Strengthened results on nonregular PDL. Technical Report MCS99-13, Weizmann Institute of Science (1999)"},{"key":"20_CR7","volume-title":"Foundations of Computing","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. In: Foundations of Computing, MIT Press, Cambridge (2000)"},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/0222054","volume":"22","author":"D. Harel","year":"1993","unstructured":"Harel, D., Raz, D.: Deciding properties of nonregular programs. SIAM Journal on Computing\u00a022(4), 857\u2013874 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR9","unstructured":"Harel, D., Singerman, E.: More on nonregular PDL: Expressive power, finite models, fibonacci programs. In: ISTCS: 3rd Israeli Symposium on the Theory of Computing and Systems (1995)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-540-30538-5_34","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"C. L\u00f6ding","year":"2004","unstructured":"L\u00f6ding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 408\u2013420. Springer, Heidelberg (2004)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/11538363_29","volume-title":"Computer Science Logic","author":"C. Lutz","year":"2005","unstructured":"Lutz, C.: PDL with intersection and converse is decidable. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 413\u2013427. Springer, Heidelberg (2005)"},{"key":"20_CR12","first-page":"111","volume":"24","author":"R. Parikh","year":"1985","unstructured":"Parikh, R.: The logic of games an its applications. Annals of discrete mathematics\u00a024, 111\u2013140 (1985)","journal-title":"Annals of discrete mathematics"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(76)90022-0","volume":"3","author":"D. Park","year":"1976","unstructured":"Park, D.: Finiteness is \u03bc-ineffable. Theoretical Computer Science\u00a03, 173\u2013181 (1976)","journal-title":"Theoretical Computer Science"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R. Streett","year":"1982","unstructured":"Streett, R.: Propositional dynamic logic of looping and converse is elementary decidable. Information and Control\u00a054, 121\u2013141 (1982)","journal-title":"Information and Control"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Language Theory, vol.\u00a0III, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M. Vardi","year":"1986","unstructured":"Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences\u00a032, 183\u2013221 (1986)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11690634_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T01:32:38Z","timestamp":1552354358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11690634_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330455","9783540330462"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11690634_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}