A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables

Author Susumu Nishimura



PDF
Thumbnail PDF

File

LIPIcs.CSL.2013.578.pdf
  • Filesize: 0.68 MB
  • 19 pages

Document Identifiers

Author Details

Susumu Nishimura

Cite AsGet BibTex

Susumu Nishimura. A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 578-596, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.CSL.2013.578

Abstract

We present a fully abstract game semantics for an Algol-like parallel language with non-blocking synchronization primitive. Elaborating on Harmer's game model for nondeterminism, we develop a game framework appropriate for modeling parallelism. The game is a sophistication of the wait-notify game proposed in a previous work, which makes the signals for thread scheduling explicit with a certain set of extra moves. The extra moves induce a Kleisli category of games, on which we develop a game semantics of the Algol-like parallel language and establish the full abstraction result with a significant use of the non-blocking synchronization operation.
Keywords
  • shared variable parallelism
  • non-blocking synchronization
  • full abstraction
  • game semantics

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads