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.
Research was partially supported by National Science Foundation Grant CCR-0204242, by an EPSRC Visiting Fellowship at Edinburgh University, and by the Basic Research in Computer Science (http://www.brics.dk/) Centre of the Danish National Research Foundation. A more preliminary version of this material was presented at POPL 2004 [1].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Reynolds, J.C.: Towards a grainless semantics for shared variable concurrency (abstract only). In: Conference Record of POPL 2004: The 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York (2004)
Hoare, C.A.R.: Towards a theory of parallel programming. In: Hoare, C.A.R., Perrott, R.H. (eds.) Operating Systems Techniques. A.P.I.C, vol. 9, pp. 61–71. London, Academic Press, London (1972)
Brinch Hansen, P.: Structured multiprogramming. Communications of the ACM 15, 574–578 (1972)
Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proceedings Seventeenth Annual IEEE Symposium on Logic in Computer Science, Los Alamitos, California, pp. 55–74. IEEE Computer Society, Los Alamitos (2002)
O’Hearn, P.W.: Resources, concurrency and local reasoning. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 49–67. Springer, Heidelberg (2004)
Brookes, S.D.: A semantics for concurrent separation logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 16–34. Springer, Heidelberg (2004)
Brookes, S.D.: Full abstraction for a shared-variable parallel language. Information and Computation 127, 145–163 (1996)
Park, D.M.R.: On the semantics of fair parallelism. In: Bjørner, D. (ed.) Abstract Software Specifications. LNCS, vol. 86, pp. 504–526. Springer, Heidelberg (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reynolds, J.C. (2004). Toward a Grainless Semantics for Shared-Variable Concurrency. In: Lodaya, K., Mahajan, M. (eds) FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2004. Lecture Notes in Computer Science, vol 3328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30538-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-30538-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24058-7
Online ISBN: 978-3-540-30538-5
eBook Packages: Computer ScienceComputer Science (R0)