Now showing items 1-6 of 6

    • Concurrency Control in Resilient Objects 

      Birman, Kenneth P.; Joseph, Thomas A.; Raeuchle, Thomas (Cornell University, 1984-07)
      Resilient objects are instances of distributed abstract data types that are tolerant to failures. Due to the distributed nature of resilient objects and the use of replicated data, the potential for a high degree of ...
    • Efficient Concurrency Control for Libraries of Typed Objects 

      Raeuchle, Thomas (Cornell University, 1986-09)
      Concurrency control algorithms use a conflict detection strategy to determine operations that have to be delayed to provide a correct serialization order. To keep the cost of detecting conflicts feasible, most algorithms ...
    • Exposure to Deadlock for Communicating Processes is Hard to Detect 

      Raeuchle, Thomas; Toueg, Sam (Cornell University, 1983-05)
      It is shown that the applicability of global state analysis as a tool for proving correctness of communication protocols is rather limited. Brand, et al. showed that reachability of global deadlock states for protocols ...
    • Implementing Fault-Tolerant Distributed Objects 

      Birman, Kenneth P.; Joseph, Thomas A.; Raeuchle, Thomas; El Abbadi, Amr (Cornell University, 1984-03)
      This paper describes a technique for implementing $k$-resilient objects - distributed objects that remain available, and whose operations are guaranteed to progress to completion, despite up to $k$ site failures. The ...
    • An Overview of the Isis Project 

      Birman, Kenneth P.; Abbadi, Amr El; Dietrich, Wally; Joseph, Thomas A.; Raeuchle, Thomas (Cornell University, 1984-10)
      The goal of the ISIS projest is to provide a high-level support for fault-tolerant distributed computing by automatically replicating data and code. The extent to which information is replicated and the physical location ...
    • State Machines and Assertions (An Integrated Approach to Modelingand Verification of Distributed Systems 

      Joseph, Thomas A.; Raeuchle, Thomas; Toueg, Sam (Cornell University, 1985-11)
      This paper describes a methodology for modeling and verifying protocols for asynchronous message passing systems. It combines the techniques of finite state analysis and axiomatic verification. It overcomes the problem ...