Automated stream-based analysis of fault-tolerance

  • Scott D. Stoller
  • Fred B. Schneider
Selected Presentations Analysis Techniques
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1486)


A rigorous, automated approach to analyzing fault-tolerance of distributed systems is presented. The method is based on a stream model of computation that incorporates approximation mechanisms. One application is described: a protocol for fault-tolerant moving agents.


Abstract Interpretation Failure Scenario Moving Agent Faulty Component Byzantine Agreement 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AH87]
    S. Abramsky and C. Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis-Horwood, 1987.Google Scholar
  2. [Bro87]
    M. Broy. Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing, 2(1):13–31, 1987.zbMATHCrossRefGoogle Scholar
  3. [CdR93]
    A. Cau and W.-P. de Roever. Using relative refinement for fault tolerance. In Proc. 1st Intl. Symposium of Formal Methods Europe, pages 19–41, 1993.Google Scholar
  4. [CGL94]
    E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Trans. on Prog. Lang. and Sys., 16(5):1512–1542, 1994.CrossRefGoogle Scholar
  5. [CS96]
    R. Cleaveland and S. Sims. The NCSU Concurrency Workbench. In Proc. CAV ’96, volume 1102 of LNCS, pages 394–397. Springer-Verlag, 1996.Google Scholar
  6. [Hol91]
    G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.Google Scholar
  7. [JJ96]
    T. Janowski and M. Joseph. Dynamic scheduling in the presence of faults: Specification and verification. In Proc. FTRTFT ’96, volume 1135 of LNCS, pages 279–297. Springer-Verlag, 1996.Google Scholar
  8. [Kah74]
    G. Kahn. The semantics of a simple language for parallel programming. In J. L. Rosenfeld, editor, Information Processing 74: Proc. IFIP Congress 74, pages 471–475. North-Holland, 1974.Google Scholar
  9. [Kur94]
    R. P. Kurshan. Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.Google Scholar
  10. [LM94]
    L. Lamport and S. Merz. Specifying and verifying fault-tolerant systems. In Proc. Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of LNCS, pages 41–76. Springer-Verlag, 1994.Google Scholar
  11. [LSP82]
    L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. on Prog. Languages and Systems, 4(3):382–401, July 1982.zbMATHCrossRefGoogle Scholar
  12. [MvRSS96]
    Y. Minsky, R. van Renesse, F. B. Schneider, and S. D. Stoller. Cryptographic support for fault-tolerant distributed computing. In Proc. Seventh ACM SIGOPS European Workshop, pages 109–114. ACM Press, 1996.Google Scholar
  13. [ORSvH95]
    S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, February 1995.CrossRefGoogle Scholar
  14. [PJ94]
    D. Peled and M. Joseph. A compositional framework for fault-tolerance by specification transformation. Theoretical Computer Science, 128(1–2):99–125, 1994.zbMATHMathSciNetCrossRefGoogle Scholar
  15. [Sch96]
    H. Schepers. Real-time systems and fault-tolerance. In M. Joseph, editor, Mathematics of Dependable Systems, chapter 7. Prentice-Hall, 1996.Google Scholar
  16. [SS97]
    S. D. Stoller and F. B. Schneider. Automated analysis of fault-tolerance in distributed systems. In Proc. First ACM SIGPLAN Workshop on Automated Analysis of Software, pages 33–44, 1997. Available via Scholar
  17. [Sto97]
    S. D. Stoller. A Method and Tool for Analyzing Fault-Tolerance in Systems. PhD thesis, Cornell University, May 1997. Available via Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Scott D. Stoller
    • 1
  • Fred B. Schneider
    • 2
  1. 1.Computer Science Dept.Indiana UniversityBloomingtonUSA
  2. 2.Dept. of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations