메뉴 건너뛰기




Volumn 1346, Issue , 1997, Pages 169-183

Compositional design of multitolerant repetitive byzantine agreement

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

EID: 84860764035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0058030     Document Type: Conference Paper
Times cited : (7)

References (12)
  • 2
    • 0000173020 scopus 로고
    • Transformation of programs for fault-tolerance
    • Z. Liu and M. Joseph. Transformation of programs for fault-tolerance. Formal Aspects of Computing, 4(5):442-469, 1992.
    • (1992) Formal Aspects of Computing , vol.4 , Issue.5 , pp. 442-469
    • Liu, Z.1    Joseph, M.2
  • 6
    • 0006817479 scopus 로고
    • A self-adjusting algorithm for Byzantine agreement
    • Y. Zhao and F. B. Bastani. A self-adjusting algorithm for Byzantine agreement. Distributed Computing, 5:219-226, 1992.
    • (1992) Distributed Computing , vol.5 , pp. 219-226
    • Zhao, Y.1    Bastani, F.B.2
  • 10
    • 84947910124 scopus 로고
    • Fault Tolerance and Timing of Distributed Systems: Compositional specification and verification
    • Eindhoven University
    • H. Schepers. Fault Tolerance and Timing of Distributed Systems: Compositional specification and verification. PhD thesis, Eindhoven University, 1994.
    • (1994) PhD thesis
    • Schepers, H.1
  • 11
    • 0017173886 scopus 로고
    • An axiomatic proof technique for parallel programs
    • S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6:319-340, 1976.
    • (1976) Acta Informatica , vol.6 , pp. 319-340
    • Owicki, S.1    Gries, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.