{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:08:41Z","timestamp":1725559721397},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_73","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"904-916","source":"Crossref","is-referenced-by-count":0,"title":["Decidability in Syntactic Control of Interference"],"prefix":"10.1007","author":[{"given":"J.","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","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: O\u2019Hearn, P.W., Tennent, R. (eds.) Algol-like languages. Birkhauser, Basel (1997)"},{"key":"73_CR2","doi-asserted-by":"crossref","unstructured":"Cartwright, R., Felleisen, M.: Observable sequentiality and full abstraction. In: Proceedings of POPL 1992 (1992)","DOI":"10.1145\/143165.143232"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Ghica, D., McCusker, G.: The regular language semantics of second-order Idealised Algol. Theoretical Computer Science (2003) (to appear)","DOI":"10.1016\/S0304-3975(03)00315-3"},{"key":"73_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"Harju, T., Karhum\u00e4ki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science\u00a078, 347\u2013355 (1991)","journal-title":"Theoretical Computer Science"},{"key":"73_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"J.R. Hindley","year":"1997","unstructured":"Hindley, J.R.: Basic Simple Type Theory. Cambridge University Press, Cambridge (1997)"},{"key":"73_CR6","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: I, II and III. Information and Computation\u00a0163, 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"73_CR7","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0304-3975(83)90077-4","volume":"26","author":"E. Kinber","year":"1983","unstructured":"Kinber, E.: The inclusion problem for some classes of deterministic multitape automata. Theoretical Computer Science\u00a026, 62\u201373 (1983)","journal-title":"Theoretical Computer Science"},{"key":"73_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2004.10.022","volume":"333","author":"J. Laird","year":"2005","unstructured":"Laird, J.: Game semantics and Linear CPS interpretation. Theoretical Computer Science\u00a0333, 199\u2013224 (2005)","journal-title":"Theoretical Computer Science"},{"key":"73_CR9","unstructured":"Loader, R.: Finitary PCF is undecidable. Annals of Pure and Applied Logic (2000)"},{"key":"73_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-45793-3_17","volume-title":"Computer Science Logic","author":"G. McCusker","year":"2002","unstructured":"McCusker, G.: A fully abstract relational model of Syntactic Control of Interference. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, p. 247. Springer, Heidelberg (2002)"},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"McCusker, G.: On the semantics of the bad-variable constructor in Algol-like languages. In: Proceedings of MFPS XIX. ENTCS (2003) (to appear)","DOI":"10.1016\/S1571-0661(03)50009-3"},{"key":"73_CR12","unstructured":"McCusker, G., Wall, M.: Categorical and game semantics for SCIR. In: The proceedings of Games for Logics and Programming Languages (2004)"},{"key":"73_CR13","volume-title":"Proceedings of LICS 2003","author":"A. Murawski","year":"2003","unstructured":"Murawski, A.: On program equivalence in languages with ground-type references. In: Proceedings of LICS 2003. IEEE Press, Los Alamitos (2003)"},{"key":"73_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-31982-5_13","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Murawski","year":"2005","unstructured":"Murawski, A., Walukiewicz, I.: Third-order Idealized Algol with iteration is decidable. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 202\u2013218. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"73_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(98)00359-4","volume":"228","author":"P.W. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P.W., Power, A.J., Takeyama, M., Tennent, R.D.: Syntactic control of interference revisited. Theoretical Computer Science\u00a0228(1-2), 211\u2013252 (1999)","journal-title":"Theoretical Computer Science"},{"key":"73_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03, 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"73_CR17","doi-asserted-by":"crossref","unstructured":"Reddy, U.S.: Global state considered unnecesary: Object-based semantics for interference-free imperative programs. Lisp and Symbolic Computation\u00a09(1) (1996)","DOI":"10.1007\/BF01806032"},{"key":"73_CR18","doi-asserted-by":"crossref","unstructured":"Reynolds, J.: Syntactic Control of Interference. Conf. Record 5th ACM Symposium on Principles of Programming Languages, 39\u201346 (1978)","DOI":"10.1145\/512760.512766"},{"key":"73_CR19","first-page":"345","volume-title":"Algorithmic Languages","author":"J. Reynolds","year":"1981","unstructured":"Reynolds, J.: The essence of Algol. In: Algorithmic Languages, pp. 345\u2013372. North Holland, Amsterdam (1981)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:47:08Z","timestamp":1619506028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11523468_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}