{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:42:12Z","timestamp":1748716932115,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029833","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:14:31Z","timestamp":1056564871000},"page":"245-256","source":"Crossref","is-referenced-by-count":17,"title":["Observational equivalence of 3rd-order Idealized Algol is decidable"],"prefix":"10.1109","author":[{"given":"C.-H.L.","family":"Ong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Games for recursive types","year":"1998","author":"mccusker","key":"ref10"},{"key":"ref11","article-title":"On the semantics of Idealized Algol without the bad-variable constructor","author":"mccusker","year":"2001","journal-title":"Technical Report 01\/01 SOCS University of Sussex"},{"journal-title":"Computation Finite and Infinite Machines","year":"1967","author":"minsky","key":"ref12"},{"key":"ref13","volume":"i and ii","author":"o'hearn","year":"1997","journal-title":"Algol-like languages"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90887-6"},{"key":"ref15","article-title":"Operational semantics and program equivalence","author":"pitts","year":"2000","journal-title":"APPSEM 2000 Summer School Lectures Portugal"},{"key":"ref16","first-page":"345","article-title":"The essence of Algol","author":"reynolds","year":"1978","journal-title":"Algorithmic Languages"},{"key":"ref17","first-page":"231:309","article-title":"Complete formal systems for equivalence problems","author":"s\u00e9nizergues","year":"2001","journal-title":"TCS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00389-3"},{"key":"ref19","article-title":"Deciding DPDA equivalence is primitive recursive","author":"stirling","year":"2001","journal-title":"Ftp-able preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80958-7"},{"key":"ref3","article-title":"A regular-language model for Hoare-style correctness statements","author":"ghica","year":"0","journal-title":"Proc VCL'2001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526619.005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_10"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322074"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3851-3_10"},{"key":"ref1","article-title":"Semantics via game theory","author":"abramsky","year":"2001","journal-title":"Lecture slides Marktoberdorf International Summer School"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00194-8"}],"event":{"name":"17th Annual IEEE Symposium on Logic in Computer Science","acronym":"LICS-02","location":"Copenhagen, Denmark"},"container-title":["Proceedings 17th Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8005\/22127\/01029833.pdf?arnumber=1029833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T16:18:33Z","timestamp":1489162713000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029833\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029833","relation":{},"subject":[]}}