May&Must-Equivalence of Shared Variable Parallel Programs in Game Semantics

We present a game semantics for an Algol-like language with shared variable parallelism. On contrary to deterministic sequential programs, whose semantics can be characterized by observing termination behaviors, it is crucial for parallel programs to observe not only termination but also divergence,...

Full description

Saved in:
Bibliographic Details
Published inIPSJ Online Transactions Vol. 5; pp. 167 - 176
Main Authors Watanabe, Keisuke, Nishimura, Susumu
Format Journal Article
LanguageEnglish
Published Information Processing Society of Japan 2012
Subjects
full abstraction
game semantics
may & must-convergence
shared-variable parallelism
Online AccessGet full text

Cover

More Information
Summary:We present a game semantics for an Algol-like language with shared variable parallelism. On contrary to deterministic sequential programs, whose semantics can be characterized by observing termination behaviors, it is crucial for parallel programs to observe not only termination but also divergence, because of nondeterministic scheduling of parallel processes. In order to give a more appropriate foundation for modeling parallelism, we base our development on Harmer's game semantics, which concerns not only may-convergence but also must-convergence for a nondeterministic programming language EIA. The game semantics for the Algol-like parallel language is shown to be fully abstract, which indicates that the parallel command of our Algol-like language adds no extra power than nondeterminism provided by EIA. We also sketch how the equivalence of two parallel programs can be reasoned about based on the game semantical interpretation.
ISSN:1882-6660
DOI:10.2197/ipsjtrans.5.167