{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:12:12Z","timestamp":1740287532761,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642139611"},{"type":"electronic","value":"9783642139628"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13962-8_37","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T12:33:57Z","timestamp":1277555637000},"page":"331-341","source":"Crossref","is-referenced-by-count":1,"title":["Focusing in Asynchronous Games"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Mimram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"37_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1017\/S0960129503003980","volume":"13","author":"S. Abramsky","year":"2003","unstructured":"Abramsky, S.: Sequentiality vs. concurrency in games and logic. Mathematical Structures in Computer Science\u00a013(4), 531\u2013565 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, 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)"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: Games and Full Completeness for Multiplicative Linear Logic. The Journ. of Symb. Logic\u00a059(2), 543\u2013574 (1994)","journal-title":"The Journ. of Symb. Logic"},{"issue":"2","key":"37_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation\u00a0163(2), 409\u2013470 (2000)","journal-title":"Information and Computation"},{"key":"37_CR5","first-page":"431","volume":"99","author":"S. Abramsky","year":"1999","unstructured":"Abramsky, S., Melli\u00e8s, P.-A.: Concurrent games and full completeness. LICS\u00a099, 431\u2013442 (1999)","journal-title":"LICS"},{"issue":"3","key":"37_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.M. Andreoli","year":"1992","unstructured":"Andreoli, J.M.: Logic Programming with Focusing Proofs in Linear Logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"37_CR7","unstructured":"Chaudhuri, K., Miller, D., Saurin, A.: Canonical Sequent Proofs via Multi-Focusing. In: International Conference on Theoretical Computer Science (2008)"},{"key":"37_CR8","first-page":"301","volume":"172","author":"P.L. Curien","year":"2007","unstructured":"Curien, P.L.: Definability and Full Abstraction. ENTCS\u00a0172, 301\u2013310 (2007)","journal-title":"ENTCS"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"M. Hyland","year":"2000","unstructured":"Hyland, M., Ong, L.: On Full Abstraction for PCF: I, II and III. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11539452_8","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"J. Laird","year":"2005","unstructured":"Laird, J.: A game semantics of the asynchronous \u03c0-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 51\u201365. Springer, Heidelberg (2005)"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-28644-8_29","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.-A. Melli\u00e8s","year":"2004","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 2: the true concurrency of innocence. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 448\u2013465. Springer, Heidelberg (2004)"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 4: a fully complete model of propositional linear logic. In: Proceedings of 20th LICS, pp. 386\u2013395 (2005)","DOI":"10.1109\/LICS.2005.6"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74407-8_27","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"P.-A. Melli\u00e8s","year":"2007","unstructured":"Melli\u00e8s, P.-A., Mimram, S.: Asynchronous Games: Innocence without Alternation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 395\u2013411. Springer, Heidelberg (2007)"},{"key":"37_CR15","unstructured":"Mimram, S.: S\u00e9mantique des jeux asynchrones et r\u00e9\u00e9criture 2-dimensionnelle. PhD thesis, PPS, CNRS\u2013Univ. Paris Diderot (2008)"},{"issue":"3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. TCS\u00a05(3), 223\u2013255 (1977)","journal-title":"TCS"},{"key":"37_CR17","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"G. Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of Logic in Computer Science, vol.\u00a03, pp. 1\u2013148. Oxford University Press, Oxford (1995)"}],"container-title":["Lecture Notes in Computer Science","Programs, Proofs, Processes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13962-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T08:23:42Z","timestamp":1740212622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13962-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139611","9783642139628"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13962-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}