Skip to main content

Specifying Fault-Tolerance Using Split Precondition Logic

(Short Paper)

  • Conference paper
Book cover Distributed Computing and Networking (ICDCN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5935))

Included in the following conference series:

  • 767 Accesses

Abstract

The focus of the paper is to provide a formal logic, for specifying fault-tolerant systems, using a state and transition based approach. Another goal is to reason, formally, about the possible behaviors of a system consisting of some malicious nodes. The Byzantine agreement protocol serves as an illustration for the notation. The contribution is the development of a style of modeling and reasoning that allows for a straightforward and thorough analysis of fault-tolerant systems.

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

Access this chapter

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. Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  2. Singh, A.K., Bandyopadhyay, A.K.: Verifying Mutual Exclusion and Liveness Properties with Split Preconditions. J. Comp. Sc. & Tech. 19(6), 795–802 (2004)

    Article  MathSciNet  Google Scholar 

  3. Arora, A., Gouda, M.: Closure and Convergence: A Foundation of Fault-Tolerant Computing. IEEE Trans. Soft. Engg. 19(11), 1015–1027 (1993)

    Article  Google Scholar 

  4. Banerjee, J., Bandyopadhyay, A.K., Mandal, A.K.: Ordering of Events in Two-Process Concurrent System. ACM SIGSOFT Soft. Engg. Notes 32(4), 1–7 (2007)

    Article  Google Scholar 

  5. Chandi, K.M., Sanders, B.A.: Predicate Transformers for Reasoning about Concurrent Computation. Sc. Comp. Prog. 24, 129–148 (1995)

    Article  Google Scholar 

  6. Dierks, H.: Comparing Model Checking and Logical Reasoning for Real-Time Systems. Formal Aspects of Computing 16(2), 104–120 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Singh, A.K., Bandyopadhyay, A.K. (2010). Specifying Fault-Tolerance Using Split Precondition Logic. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11322-2_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11321-5

  • Online ISBN: 978-3-642-11322-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics