Toward a grainless semantics for shared-variable concurrency

20Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Conventional semantics for shared-variable concurrency suffers from the "grain of time" problem, i.e., the necessity of specifying a default level of atomicity. We propose a semantics that avoids any such choice by regarding all interference that is not controlled by explicit critical regions as catastrophic. It is based on three principles: - Operations have duration and can overlap one another during execution. - If two overlapping operations touch the same location, the meaning of the program execution is "wrong". - If, from a given starting state, execution of a program can give "wrong", then no other possibilities need be considered. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Reynolds, J. C. (2004). Toward a grainless semantics for shared-variable concurrency. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3328, 35–48. https://doi.org/10.1007/978-3-540-30538-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free