Angelic semantics of fine-grained concurrency

@inproceedings{Ghica2004AngelicSO,
  title={Angelic semantics of fine-grained concurrency},
  author={Dan R. Ghica and Andrzej S. Murawski},
  booktitle={Ann. Pure Appl. Log.},
  year={2004}
}
Full Abstraction Without Synchronization Primitives
Fully-abstract concurrent games for pi
TLDR
A semantics for Milner's pi-calculus is defined, with three main novelties, based on reduction semantics, which provides a fully-abstract model for fair testing equivalence and has a strong game semantical flavor in the sense of Hyland-Ong and Nickau.
Fully-abstract concurrent games for π
TLDR
A semantics for Milner's pi-calculus is defined, with three main novelties, based on reduction semantics, which provides a fully-abstract model for fair testing equivalence and has a strong game semantical flavor in the sense of Hyland-Ong and Nickau.
An invitation to game semantics
TLDR
This work presents a gentle introduction to game semantics, focussing on high-level ideas and examples with a view to providing a bridge to more technical literature.
Data-abstraction refinement: a game semantic approach
TLDR
A fully abstract game semantics in the style of Hyland and Ong and a more intensional version of the model that tracks nondeterminism introduced by abstraction in order to detect false counterexamples are used.
The Parallel Intensionally Fully Abstract Games Model of PCF
TLDR
This work describes a framework for truly concurrent game semantics of programming languages, based on Rideau and Winskel's concurrent games on event structures, and gives an alternative interpretation of Plot kin's PCF that takes advantage of the concurrent nature of strategies and formalizes the idea that although PCF is a sequential language, certain sub-computations are independent and can be computed in a parallel fashion.
Syntactic control of concurrency
Definability and Full Abstraction
  • P. Curien
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2007
Applications of Game Semantics: From Program Analysis to Hardware Synthesis
  • D. Ghica
  • Computer Science
    2009 24th Annual IEEE Symposium on Logic In Computer Science
  • 2009
TLDR
After informally reviewing the main concepts from game semantics and placing the development of the field in a historical context, the field is examined in particular on finite state model checking, higher order model checking and more recent developments in hardware design.
Non-angelic Concurrent Game Semantics
The hiding operation, crucial in the compositional aspect of game semantics, removes computation paths not leading to observable results. Accordingly, games models are usually biased towards angelic
...
...

References

SHOWING 1-10 OF 28 REFERENCES
A Game Semantics of Idealized CSP
Syntactic control of concurrency
Applying Game Semantics to Compositional Software Modeling and Verification
TLDR
A software model checking tool founded on game semantics, based on an interpretation algorithm defined compositionally on syntax and thus can also handle open programs, which turns out to lead to very compact models of programs.
Concurrent games and full completeness
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an
Full Abstraction for a Shared-Variable Parallel Language
TLDR
It is shown how to modify the semantics to incorporate new program constructs, to allow for different levels of granularity or atomicity, and to model fair infinite computation, in each case achieving full abstraction with respect to an appropriate notion of program behavior.
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions
Algorithmic Game Semantics and Component−Based Verification
TLDR
A prototypical software modeling and verification tool is described that can handle open programs and the fact that the models it produces are observationally fully abstract is essential in the modeling and verify of software components such as modules.
Reasoning about Idealized ALGOL Using Regular Languages
TLDR
It is shown that reasoning can be carried out using only a meta-language of extended regular expressions, a language for which equivalence is formally decidable, which makes it uniquely suitable for automation.
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
TLDR
The use of the π-calculus for semantical descriptions of languages such as Concurrent Idealised ALGOL (CIA), combining imperative, functional and concurrent features, is studied, demonstrating that there is a close operational correspondence between them and that the ρ-Calculus semantics is sound.
Asynchronous Games 2: The True Concurrency of Innocence
...
...