{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:04:21Z","timestamp":1776373461571,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540253884","type":"print"},{"value":"9783540319825","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_13","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"202-218","source":"Crossref","is-referenced-by-count":20,"title":["Third-Order Idealized Algol with Iteration Is Decidable"],"prefix":"10.1007","author":[{"given":"Andrzej S.","family":"Murawski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","first-page":"345","volume-title":"Algorithmic Languages","author":"J.C. Reynolds","year":"1981","unstructured":"Reynolds, J.C.: The essence of Algol. In: Algorithmic Languages, pp. 345\u2013372. North-Holland, Amsterdam (1981)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-540-24730-2_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Abramsky","year":"2004","unstructured":"Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.-H.L.: Applying game semantics to compositional software modelling and verification. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 421\u2013435. Springer, Heidelberg (2004)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-45022-X_10","volume-title":"Automata, Languages and Programming","author":"D.R. Ghica","year":"2000","unstructured":"Ghica, D.R., McCusker, G.: Reasoning about Idealized Algol using regular expressions. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 103\u2013115. Springer, Heidelberg (2000)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Ong, C.-H.L.: Observational equivalence of 3rd-order Idealized Algol is decidable. In: Proc. of LICS, pp. 245\u2013256 (2002)","DOI":"10.1109\/LICS.2002.1029833"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Murawski, A.S.: On program equivalence in languages with ground-type references. In: Proc. of LICS, pp. 108\u2013117 (2003)","DOI":"10.1109\/LICS.2003.1210050"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-1-4757-3851-3_10","volume-title":"Algol-like languages","author":"S. Abramsky","year":"1997","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: Algol-like languages, pp. 297\u2013329. Birkha\u00fcser, Basel (1997)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput.\u00a019(3), 424\u2013437 (1990)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:44:42Z","timestamp":1620013482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}