Brief announcement: On the impossibility of detecting concurrency

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We identify a general principle of distributed computing: one cannot force two processes running in parallel to see each other. This principle is formally stated in the context of asynchronous processes communicating through shared objects, using trace-based semantics. We prove that it holds in a reasonable computational model, and then study the class of concurrent specifications which satisfy this property. This allows us to derive a Galois connection theorem for different variants of linearizability.

Original languageEnglish
Title of host publication32nd International Symposium on Distributed Computing, DISC 2018
EditorsUlrich Schmid, Josef Widder
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770927
DOIs
Publication statusPublished - 1 Oct 2018
Event32nd International Symposium on Distributed Computing, DISC 2018 - New Orleans, United States
Duration: 15 Oct 201819 Oct 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume121
ISSN (Print)1868-8969

Conference

Conference32nd International Symposium on Distributed Computing, DISC 2018
Country/TerritoryUnited States
CityNew Orleans
Period15/10/1819/10/18

Keywords

  • Concurrent object
  • Concurrent specification
  • Linearizability

Fingerprint

Dive into the research topics of 'Brief announcement: On the impossibility of detecting concurrency'. Together they form a unique fingerprint.

Cite this