License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICCSW.2013.1
URN: urn:nbn:de:0030-drops-42843
Go to the corresponding OASIcs Volume Portal

Hoare, Tony

Laws of programming with concurrency (Invited Talk)

23.pdf (0.3 MB)


The algebraic laws for programming with concurrency are as simple as (and very similar to) the familiar laws of arithmetic. Yet they are stronger for reasoning about the properties of programs than the axioms of Hoare Logic and the rules of an operational semantics put together.

BibTeX - Entry

  author =	{Tony Hoare},
  title =	{{Laws of programming with concurrency (Invited Talk)}},
  booktitle =	{2013 Imperial College Computing Student Workshop},
  pages =	{1--1},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-63-7},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{35},
  editor =	{Andrew V. Jones and Nicholas Ng},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-42843},
  doi =		{10.4230/OASIcs.ICCSW.2013.1},
  annote =	{Keywords: concurrency}

Keywords: concurrency
Collection: 2013 Imperial College Computing Student Workshop
Issue Date: 2013
Date of publication: 14.10.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI