Advertisement

An axiomatization of wait-freedom and low-atomicity

  • Ambuj K. Singh
Theory Of Computing, Algorithms And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)

Abstract

The concepts of wait-freedom and low-atomicity in concurrent shared-variable programs are explored in the frameworks of temporal logic and UNITY. With the help of some new primitives, axioms for these concepts are presented. Later, these axioms are used to prove the impossibility of distributed consensus.

Keywords

Temporal Logic Shared Variable Program Variable Computation Path Linear Time Temporal Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Anderson, J. H., and M. G. Gouda, The Virtue of Patience: Concurrent Programming With and Without Waiting, work in progress.Google Scholar
  2. [2]
    Chandy, K. M., and J. Misra, Parallel Program Design: A Foundation, Reading, Massachusetts: Addison-Wesley, 1988.Google Scholar
  3. [3]
    Emerson, E. A., and J. Y. Halpern, “Sometimes” and “Not Never” Revisited: On Branching Time versus Linear Time Temporal Logic, Journal of the ACM, 33(1), January 1986, pp. 151–178.Google Scholar
  4. [4]
    Fischer, M., N. Lynch, and M. Patterson, Impossibility of Distributed Consensus with One Faulty Process, Second Annual ACM Symposium on the Principles of Distributed Computing, 1983, pp. 1–7.Google Scholar
  5. [5]
    Herlihy, M., Impossibility and Universality Results for Wait-free Synchronization, Seventh Annual ACM Symposium on the Principles of Distributed Computing, 1987, pp. 276–290.Google Scholar
  6. [6]
    Lamport, L., On Interprocess Communication, parts I and II, Distributed Computing, 1(2), 1986, pp. 77–101.Google Scholar
  7. [7]
    Manna, Z., and A. Pnueli, Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs, Science of Computer Programming, 4, 1984, pp. 257–289.Google Scholar
  8. [8]
    Peterson, G. L., and J. E. Burns, Concurrent Reading While Writing II: the Multi-writer Case, Twenty-eighth Annual Symposium on the Foundations of Computer Science, 1987, pp. 383–392.Google Scholar
  9. [9]
    Singh, A. K., J. H. Anderson, and M. G. Gouda, The Elusive Atomic Register Revisited, Sixth Annual ACM Symposium on the Principles of Distributed Computing, 1987, pp. 206–221.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ambuj K. Singh
    • 1
  1. 1.Department of Computer ScienceUniversity of California at Santa BarbaraSanta Barbara

Personalised recommendations