Concurrency semantics

From Wikipedia, the free encyclopedia

In computer science, concurrency semantics is a way to give meaning to concurrent systems in a mathematically rigorous way (for discussion see Concurrency (computer science)).

Concurrency semantics is often based on mathematical theories of concurrency, e.g., the Actor model and process calculi.

[edit] References

  • Irene Greif. Semantics of Communicating Parallel Processes MIT EECS Doctoral Dissertation. August 1975.
  • Aki Yonezawa. Specification and Verification Techniques for Parallel Programs Based on Message Passing Semantics MIT EECS Doctoral Dissertation. December 1977.
  • Carl Hewitt and Russ Atkinson. Specification and Proof Techniques for Serializers IEEE Transactions on Software Engineering. January 1979.
  • Carl Hewitt, Beppe Attardi, and Henry Lieberman. Delegation in Message Passing Proceedings of First International Conference on Distributed Systems Huntsville, AL, USA. October 1979.
  • Russ Atkinson. Automatic Verification of Serializers MIT Doctoral Dissertation. June, 1980.
  • Will Clinger. Foundations of Actor Semantics MIT Mathematics Doctoral Dissertation. June 1981.
  • Matthew Hennessy. A Term Model for Synchronous Processes Computer Science Department, Edinburgh University. CSR-77-81. 1981.
  • C.A.R. Hoare, S. Brookes and A.W. Roscoe. A Theory of Communicating Sequential Processes Programming Research Group, Oxford University. 1981.
  • Gul Agha. Actors: A Model of Concurrent Computation in Distributed Systems Doctoral Dissertation. 1986.
  • Gul Agha, Ian Mason, Scott Smith, and Carolyn Talcott. A Foundation for Actor Computation Journal of Functional Programming, January 1993.
  • Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus POPL 1996.
  • Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and Didier Rémy. A Calculus of Mobile Agents CONCUR 1996.
  • Gérard Boudol. The pi-calculus in direct style POPL 1997.
  • Davide Sangiorgi and David Walker. The Pi-Calculus: A Theory of Mobile Processes Cambridge University Press. 2001.
  • Nick Benton, Luca Cardelli and Cédric Fournet. Modern Concurrency Abstractions for C# ECOOP 2002.