{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:24Z","timestamp":1753894404209,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Game semantics is a denotational semantics presenting compositionally the\ncomputational behaviour of various kinds of effectful programs. One of its\ncelebrated achievement is to have obtained full abstraction results for\nprogramming languages with a variety of computational effects, in a single\nframework. This is known as the semantic cube or Abramsky's cube, which for\nsequential deterministic programs establishes a correspondence between certain\nconditions on strategies (''innocence'', ''well-bracketing'', ''visibility'')\nand the absence of matching computational effects. Outside of the sequential\ndeterministic realm, there are still a wealth of game semantics-based full\nabstraction results; but they no longer fit in a unified canvas. In particular,\nGhica and Murawski's fully abstract model for shared state concurrency (IA)\ndoes not have a matching notion of pure parallel program-we say that\nparallelism and interference (i.e. state plus semaphores) are entangled. In\nthis paper we construct a causal version of Ghica and Murawski's model, also\nfully abstract for IA. We provide compositional conditions parallel innocence\nand sequentiality, respectively banning interference and parallelism, and\nleading to four full abstraction results. To our knowledge, this is the first\nextension of Abramsky's semantic cube programme beyond the sequential\ndeterministic world.<\/jats:p>","DOI":"10.46298\/lmcs-20(3:24)2024","type":"journal-article","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T19:10:08Z","timestamp":1726773008000},"source":"Crossref","is-referenced-by-count":0,"title":["Disentangling Parallelism and Interference in Game Semantics"],"prefix":"10.46298","volume":"Volume 20, Issue 3","author":[{"given":"Simon","family":"Castellan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Clairambault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2024,9,18]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/14304\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/14304\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T19:10:08Z","timestamp":1726773008000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/7675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,18]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(3:24)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2103.15453v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2103.15453v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2103.15453","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2103.15453","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,9,18]]},"article-number":"7675"}}