{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:11Z","timestamp":1794381071518,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_58","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"683-694","source":"Crossref","is-referenced-by-count":8,"title":["Syntactic Control of Concurrency"],"prefix":"10.1007","author":[{"given":"D. R.","family":"Ghica","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. S.","family":"Murawski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C. -H. L.","family":"Ong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation\u00a0163 (2000)","DOI":"10.1006\/inco.2000.2930"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation\u00a0163 (2000)","DOI":"10.1006\/inco.2000.2917"},{"key":"58_CR3","series-title":"ENTCS","volume-title":"Proceedings of 1996 Workshop on Linear Logic","author":"S. Abramsky","year":"1996","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state. In: Proceedings of 1996 Workshop on Linear Logic. ENTCS, vol.\u00a03, Elsevier, Amsterdam (1996)"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Laird, J.: Full abstraction for functional languages with control. In: LICS 12 (1997)","DOI":"10.1109\/LICS.1997.614931"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: LICS 13 (1998)","DOI":"10.1109\/LICS.1998.705669"},{"key":"58_CR6","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 languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, p. 103. Springer, Heidelberg (2000)"},{"key":"58_CR7","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 modeling and verification. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 421\u2013435. Springer, Heidelberg (2004)"},{"key":"58_CR8","doi-asserted-by":"crossref","unstructured":"Ghica, D.R.: Regular language semantics for a call-by-value programming language. In: Proceedings of MFPS 17. ENTCS, vol.\u00a045 (2001)","DOI":"10.1016\/S1571-0661(04)80958-7"},{"key":"58_CR9","unstructured":"Ghica, D.R.: A regular-language model for Hoare-style correctness statements. In: Proceedings of the Verification and Computational Logic (2001)"},{"key":"58_CR10","unstructured":"Ghica, D.R.: A Games-based Foundation for Compositional Software Model Checking. PhD thesis, Queen\u2019s University School of Computing, Canada (2002)"},{"key":"58_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-24727-2_16","volume-title":"Foundations of Software Science and Computation Structures","author":"D.R. Ghica","year":"2004","unstructured":"Ghica, D.R., Murawski, A.S.: Angelic semantics of fine-grained concurrency. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 211\u2013225. Springer, Heidelberg (2004)"},{"key":"58_CR12","unstructured":"Abramsky, S.: Beyond Full Abstraction: model-checking for Algol-like languages Marktoberdorf International Summer School (2001) (lecture slides)"},{"key":"58_CR13","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049, 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"58_CR14","doi-asserted-by":"crossref","unstructured":"Hofmann, M.: Linear types and non-size-increasing polynomial time computation. In: LICS 14 (1999)","DOI":"10.1109\/LICS.1999.782641"},{"key":"58_CR15","doi-asserted-by":"crossref","unstructured":"Hofmann, M.: A type system for bounded space and functional in-place update. Nordic Journal of Computing 7 (2000)","DOI":"10.1007\/3-540-46425-5_11"},{"key":"58_CR16","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L.: Recursion and dynamic data-structures in bounded space: Towards embedded ML programming. In: ICFP 4. ACM SIGPLAN Notices, vol.\u00a034 (1999)","DOI":"10.1145\/317636.317785"},{"key":"58_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis","author":"M. Tofte","year":"1995","unstructured":"Tofte, M.: Region inference for higher-order functional languages. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983, Springer, Heidelberg (1995)"},{"key":"58_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-45022-X_5","volume-title":"Automata, Languages and Programming","author":"A. Mycroft","year":"2000","unstructured":"Mycroft, A., Sharp, R.: A statically allocated parallel functional language. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, p. 37. Springer, Heidelberg (2000)"},{"key":"58_CR19","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: POPL 24 (1997)","DOI":"10.1145\/263699.263712"},{"key":"58_CR20","doi-asserted-by":"crossref","unstructured":"Wansbrough, K., Jones, S.L.P.: Once upon a polymorphic type. In: POPL 26 (1999)","DOI":"10.1145\/292540.292545"},{"key":"58_CR21","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Syntactic control of interference. In: POPL 5 (1978)","DOI":"10.1145\/512760.512766"},{"key":"58_CR22","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"58_CR23","series-title":"Handbook of Logic in Computer Science","volume-title":"Background: Computational Structures","author":"H.P. Barendregt","year":"1992","unstructured":"Barendregt, H.P.: Lambda calculi with types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Background: Computational Structures. Handbook of Logic in Computer Science, vol.\u00a02, Oxford University Press, Oxford (1992)"},{"key":"58_CR24","doi-asserted-by":"crossref","unstructured":"Brookes, S.: The essence of Parallel Algol. In: LICS 11 (1996)","DOI":"10.1109\/LICS.1996.561315"},{"key":"58_CR25","series-title":"Distinguished DissertationsLimited","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0615-9","volume-title":"Games and Full Abstraction for a Functional Metalanguage with Recursive Types","author":"G. McCusker","year":"1998","unstructured":"McCusker, G.: Games and Full Abstraction for a Functional Metalanguage with Recursive Types. Distinguished DissertationsLimited. Springer-Verlag Limited, Heidelberg (1998)"},{"key":"58_CR26","volume-title":"Theory and Practice of Concurrency","author":"W.A. Roscoe","year":"1998","unstructured":"Roscoe, W.A.: Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:01Z","timestamp":1605741841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_58","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}