Full abstraction without synchronization primitives

DOI10.1016/J.ENTCS.2010.08.025MaRDI QIDQ3178268zbMATH OpenOpenAlexFDO

Authors Andrzej S. Murawski

Publication date 8 July 2016

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2010.08.025

zbMATH Keywords

full abstractiongame semanticsmutual exclusionshared-variable concurrency

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Applications of game theory (91A80)

Recommendations

• A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables
• A Game Semantics of Idealized CSP
• Angelic semantics of fine-grained concurrency
• scientific article; zbMATH DE number 1231510
• Full abstraction for a shared-variable parallel language

Cites work

• A Game Semantics of Idealized CSP
• A new solution of Dijkstra's concurrent programming problem
• Angelic semantics of fine-grained concurrency
• Bad Variables Under Control
• scientific article; zbMATH DE number 3278860 (Why is no real title available?)
• Myths about the mutual exclusion problem
• On the semantics of the bad-variable constructor in Algol-like languages
• The essence of parallel Algol.

Cited in

(4)

• Angelic semantics of fine-grained concurrency
• Synchronous game semantics via round abstraction
• scientific article; zbMATH DE number 1231510 (Why is no real title available?)
• Disentangling parallelism and interference in game semantics

This page was built for publication: Full abstraction without synchronization primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178268)