Advertisement

Abstract

Consider a reactive system of the form S1S2. Given the specification of one component, say S1, methods are available to design S2 in a stepwise manner such that the composed system S1S2 satisfies a given specification. In this paper, we use a similar paradigm to construct a fault-tolerant program. Given a program S1 that may suffer from hardware faults or software design faults, we show how a stepwise method can be used to design a program S2 so that S1S2 meets a given specification. The main idea is demonstrated by solving a resource allocation problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AL90]
    M. Abadi and L. Lamport. Composing specifications. Technical Report 66, Digital SRC, California, 1990.Google Scholar
  2. [AL91]
    M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, May 1991.Google Scholar
  3. [CH93]
    J. Coenen and J. Hooman. Parameterized semantics for fault-tolerant real-time systems. In J. Vytopil, editor. Formal Techniques in Real-Time and Fault Tolerant Systems, pages 51–78. Kluwer Academic Publishers, 1993.Google Scholar
  4. [CM88]
    K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley Publishing Company, 1988.Google Scholar
  5. [Lam84]
    L. Lamport. Using time instead of timeout for fault-tolerant distributed systems. ACM Transactions on Programming Languages and Systems, 6(2):254–280, April 1984.Google Scholar
  6. [Lam91]
    L. Lamport. The temporal logic of actions. Technical Report 79, Digital SRC, California, 1991.Google Scholar
  7. [Liu91]
    Z. Liu. Fault-Tolerant Programming By Transformations. PhD thesis, Department of Computer Science, University of Warwick, Coventry, CV4 7AL. UK., 1991.Google Scholar
  8. [LJ92]
    Z. Liu and M. Joseph. Transformation of programs for fault tolerance. Formal Aspects of Computing, 4(5):442–469, 1992.Google Scholar
  9. [LJ93a]
    Z. Liu and M. Joseph. A formal framework for fault-tolerant. Programms. In IMA Conference on Mathematics of Dependable Systems. Royal Holloway. London, UK., 1993.Google Scholar
  10. [LJ93b]
    Z. Liu and M. Joseph. Specifying and verifying of recovery in asynchronous communicating systems. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault Tolerant Systems, pages 137–166. Kluwer Academic Publishers, 1993.Google Scholar
  11. [LSP82]
    L. Lamport, R. Shostak, and M. Pease. The Byzantine General problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, July 1982.Google Scholar
  12. [Nor92]
    J. Nordahl. Specification and Design of Dependable Communicating Systems. PhD thesis, Department of Computer Science, Technical University of Denmark, DK-2800, Lyngby, Denmark, 1992.Google Scholar
  13. [Per86]
    K.J. Perry. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, SE-12(3):477–482, 1986.Google Scholar
  14. [PSL80]
    M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228–234, April 1980.Google Scholar
  15. [Sch82]
    F.B. Schneider. Fault-tolerant broadcasts. ACM Transactions on Programming Languages and Systems, 4(2):125–148, April 1982.Google Scholar
  16. [Sch93]
    H. Schepers. Tracing fault-tolerance. In Proceedings 3rd IFIP Working Conference on Dependable Computing for Critical Applications. Springer-Verlag, 1993.Google Scholar
  17. [SG84]
    F.B. Schneider and D. Gries. Fault-tolerant broadcasts. Science of Computer Programming, 4:1–15, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Zhiming Liu
    • 1
  • Mathai Joseph
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryUK

Personalised recommendations