Skip to main content
SpringerLink
Log in

Revisiting Safety and Liveness in the Context of Failures

  • Conference paper
  • First Online:
CONCUR 2000 — Concurrency Theory (CONCUR 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1877))

Included in the following conference series:

Abstract

Safety and liveness are two fundamental concepts for proving the correctness of concurrent programs. In the context of failures, however, we observe that some properties that are commonly believed to be safety properties are actually liveness properties. In this paper, we propose refinements of the concepts of safety and liveness that avoid this counterintuitive classification.

Research partially supported by NSF grants CCR-9711403.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21(4):181–185, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Mc Graw Hill, 1998.

    Google Scholar 

  3. B. Charron-Bost and André Schiper. Uniform consensus is harder than consensus. Technical report, École Polytechnique Fédérale de Lausanne, April 2000.

    Google Scholar 

  4. Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685–722, July 1996. An extended abstract appeared in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, August, 1992, 147–158.

    Google Scholar 

  5. Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77–97, January 1987.

    Google Scholar 

  6. Cynthia Dwork, Nancy A. Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288–323, April 1988.

    Google Scholar 

  7. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.

    Google Scholar 

  8. Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: proceedings of the IFIP 9th World Congress, pages 657–668. IFIP, North-Holland, September 1983.

    Google Scholar 

  9. Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1996.

    Google Scholar 

  10. Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374–419, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  11. Amir Pnueli. The temporal logic of programs. In Proceedings of the 18th Symposium on Foundations of Computer Science, pages 46–57. IEEE Computer Society Press, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIX, École Polytechnique, 91128, Palaiseau Cedex, France

    Bernadette Charron-Bost

  2. DIX, École Polytechnique, 91128, Palaiseau Cedex, France

    Sam Toueg

  3. Bell Labs, Lucent Technologies, 600 Mountain Avenue, Murray Hill, NJ, 07974-0636, USA

    Anindya Basu

Authors
  1. Bernadette Charron-Bost
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sam Toueg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anindya Basu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Pennsylvania State University, 220 Pond Laboratory, University Park, PA, 16802-6106, USA

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Charron-Bost, B., Toueg, S., Basu, A. (2000). Revisiting Safety and Liveness in the Context of Failures. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-44618-4_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67897-7

  • Online ISBN: 978-3-540-44618-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation