메뉴 건너뛰기




Volumn 2, Issue 3, 2005, Pages 201-215

Complexity issues in automated synthesis of failsafe fault-tolerance

Author keywords

Automatic addition of fault tolerance; Distributed programs; Fault tolerance; Formal methods; Program synthesis

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SECURITY SYSTEMS; SPECIFICATIONS;

EID: 27644596280     PISSN: 15455971     EISSN: None     Source Type: Journal    
DOI: 10.1109/TDSC.2005.29     Document Type: Article
Times cited : (19)

References (20)
  • 2
    • 0027699702 scopus 로고
    • Closure and convergence: A foundation of fault-tolerant computing
    • A. Arora and M.G. Gouda, "Closure and Convergence: A Foundation of Fault-Tolerant Computing," IEEE Trans. Software Eng., vol. 19, no. 11, pp. 1015-1027, 1993.
    • (1993) IEEE Trans. Software Eng. , vol.19 , Issue.11 , pp. 1015-1027
    • Arora, A.1    Gouda, M.G.2
  • 4
    • 0010342818 scopus 로고    scopus 로고
    • Synthesis of concurrent programs for an atomic read/write model of computation
    • Mar.
    • P. Attie and A. Emerson, "Synthesis of Concurrent Programs for an Atomic Read/Write Model of Computation," ACM Trans. Programming Languages and Systems, vol. 23, no. 2, Mar. 2001.
    • (2001) ACM Trans. Programming Languages and Systems , vol.23 , Issue.2
    • Attie, P.1    Emerson, A.2
  • 5
    • 0027610755 scopus 로고
    • The consensus problem in fault-tolerant computing
    • M. Barborak, A. Dahbura, and M. Malek, "The Consensus Problem in Fault-Tolerant Computing," ACM Computing Surveys, vol. 25, no. 2, pp. 171-220, 1993.
    • (1993) ACM Computing Surveys , vol.25 , Issue.2 , pp. 171-220
    • Barborak, M.1    Dahbura, A.2    Malek, M.3
  • 8
    • 30344434682 scopus 로고    scopus 로고
    • FTSyn: A framework for automatic synthesis of fault-tolerance
    • Computer Science and Eng. Dept., Michigan State Univ., East Lansing, July
    • A. Ebnenasir and S.S. Kulkarni, "FTSyn: A Framework for Automatic Synthesis of Fault-Tolerance," Technical Report MSU-CSE-03-16, Computer Science and Eng. Dept., Michigan State Univ., East Lansing, July 2003.
    • (2003) Technical Report , vol.MSU-CSE-03-16
    • Ebnenasir, A.1    Kulkarni, S.S.2
  • 9
    • 27644447140 scopus 로고    scopus 로고
    • Efficient synthesis of failsafe fault-tolerant distributed programs
    • Computer Science and Eng. Dept., Michigan State Univ., East Lansing, Apr.
    • A. Ebnenasir and S.S. Kulkarni, "Efficient Synthesis of Failsafe Fault-Tolerant Distributed Programs," Technical Report MSU-CSE-05-13, Computer Science and Eng. Dept., Michigan State Univ., East Lansing, Apr. 2005.
    • (2005) Technical Report , vol.MSU-CSE-05-13
    • Ebnenasir, A.1    Kulkarni, S.S.2
  • 10
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty processor
    • M.J. Fischer, N.A. Lynch, and M.S. Peterson, "Impossibility of Distributed Consensus with One Faulty Processor," J. ACM., vol. 32, no. 2, pp. 373-382, 1985.
    • (1985) J. ACM , vol.32 , Issue.2 , pp. 373-382
    • Fischer, M.J.1    Lynch, N.A.2    Peterson, M.S.3
  • 13
    • 0002257571 scopus 로고
    • Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults
    • Sept.
    • L. Gong, P. Lincoln, and J. Rushby, "Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid and Link Faults," Proc. Dependable Computing for Critical Applications-5, pp. 139-157, Sept. 1995.
    • (1995) Proc. Dependable Computing for Critical Applications-5 , pp. 139-157
    • Gong, L.1    Lincoln, P.2    Rushby, J.3


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