{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:33Z","timestamp":1725489153400},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_4","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:23:08Z","timestamp":1187248988000},"page":"33-36","source":"Crossref","is-referenced-by-count":0,"title":["Model Checking Algol-Like Languages Using Game Semantics"],"prefix":"10.1007","author":[{"given":"C. -H. L.","family":"Ong","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, K. Honda, and G. McCusker. Fully abstract game semantics for general reference. In Proceedings of IEEE Symposium on Logic in Computer Science, 1998. Computer Society Press, 1998.","DOI":"10.1109\/LICS.1998.705669"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163, 2000.","DOI":"10.1006\/inco.2000.2930"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In P. W. O\u2019Hearn and R. D. Tennent, editors, Algol-like languages. Birkha\u00fcser, 1997.","DOI":"10.1007\/978-1-4757-3851-3_10"},{"key":"4_CR4","unstructured":"E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"V. Danos and R. Harmer. Probabilistic game semantics. In Proc. IEEE Symposium on Logic in Computer Science, Santa Barbara, June, 2000. Computer Science Society, 2000.","DOI":"10.1109\/LICS.2000.855770"},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-45022-X_10","volume-title":"Proceedings of 27th International Colloquium on Automata, Languages and Programming ICALP 2000","author":"D. R. Ghica","year":"2000","unstructured":"D. R. Ghica and G. McCusker. Reasoning about Idealized Algol using regular languages. In Proceedings of 27th International Colloquium on Automata, Languages and Programming ICALP 2000, pages 103\u2013116. Springer-Verlag, 2000. LNCS Vol. 1853."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"S. Ginsberg and S. Greibach. Deterministic context-free languages. Information and Control, pages 620\u2013648, 1966.","DOI":"10.1016\/S0019-9958(66)80019-0"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"R. Harmer and G. McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings of Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.","DOI":"10.1109\/LICS.1999.782637"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"D. H. D. Hughes. Games and definability for System F. In Proceedings of 12th IEEE Symposium on Logic in Computer Science. IEEE Computer Science Society, 1997.","DOI":"10.1109\/LICS.1997.614935"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J. M. E. Hyland","year":"2000","unstructured":"J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Information and Computation, 163:285\u2013408, 2000.","journal-title":"Information and Computation"},{"key":"4_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-48168-0_29","volume-title":"Computer Science Logic","author":"A. D. Ker","year":"1999","unstructured":"A. D. Ker, H. Nickau, and C.-H. L. Ong. A universal innocent game model for the B\u00f6hm tree lambda theory. In Computer Science Logic: Proceedings of the 8th Annual Conference on the EACSL Madrid, Spain, September 1999, pages 405\u2013419. Springer-Verlag, 1999. LNCS Volume 1683."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(00)00353-4","volume":"272","author":"A. D. Ker","year":"2002","unstructured":"A. D. Ker, H. Nickau, and C.-H. L. Ong. Innocent game models of untyped \u03bb-calculus. Theoretical Computer Science, 272:247\u2013292, 2002.","journal-title":"Theoretical Computer Science"},{"key":"4_CR13","unstructured":"J. Laird. A semantic analysis of control. PhD thesis, University of Edinburgh, 1998."},{"key":"4_CR14","unstructured":"A. Murawski. Finitary higher-order programming languages with first-order references are undecidable. Preprint, 2002."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"C.-H. L. Ong. Observational equivalence of third-order Idealized Algol is decidable. In Proceedings of IEEE Symposium on Logic in Computer Science, 22\u201325 July 2000, Copenhagen Denmark, pages 245\u2013256. Computer Society Press, 2002.","DOI":"10.1109\/LICS.2002.1029833"},{"key":"4_CR16","unstructured":"J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 345\u2013372. North Holland, 1978."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/251595.251617","volume":"32","author":"D. A. Schmidt","year":"1997","unstructured":"D. A. Schmidt. On the need for a popular formal semantics. ACM SIGPLAN Notices, 32:115\u2013116, 1997.","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00285-1","volume":"251","author":"G. S\u00e9nizergues","year":"2001","unstructured":"G. S\u00e9nizergues. L(A) = L(B)? Decidability results from complete formal systems. Theoretical Computer Science, 251:1\u2013166, 2001.","journal-title":"Theoretical Computer Science"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00389-3","volume":"255","author":"C. Stirling","year":"2001","unstructured":"C. Stirling. Decidability of DPDA equivalence. Theoretical Computer Science, 255:1\u201331, 2001.","journal-title":"Theoretical Computer Science"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Banff Higher Order Workshop, pages 238\u2013266. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60915-6_6"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:08:05Z","timestamp":1556770085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}