Now showing items 1-20 of 101

    • Abstractions for Fault Tolerance in Distributed Systems 

      Schneider, Fred B. (Cornell University, 1986-04)
      Abstractions useful in fault-tolerant and distributed systems are described. The abstractions are specified as properties of protocols, hence they have a different flavor from abstractions prevalent in sequential and ...
    • Adding the Everywhere Operator to Propositional Logic 

      Gries, David; Schneider, Fred B. (Cornell University, 1996-05)
      Sound and complete modal propositional logic C is presented, in which "P" has the interpretation "P is true in all states". The interpretation is already known as the Carnapian extension of S5. A new axiomatization for ...
    • An Approach to Designing Fault-Tolerant Computing Systems 

      Schlichting, Richard D.; Schneider, Fred B. (Cornell University, 1981-11)
      A methodology that facilitates the design of fault-tolerant computing systems is presented. It is based on the notion of a fail-stop processor. Such a processor automatically halts in response to any internal failure and ...
    • APSS: Proactive Secret Sharing in Asynchronous Systems 

      Zhou, Lidong; Schneider, Fred B.; van Renesse, Robbert (Cornell University, 2002-10-11)
      APSS, a proactive secret sharing (PSS) protocol for asynchronous systems, is derived and proved correct. A PSS protocol enables a set of secret shares to be periodically refreshed with a new, independent set, thereby ...
    • An Assertional Characterization of Serializability 

      McCurley, E. Robert; Schneider, Fred B. (Cornell University, 1989-09)
      Serializability is usually defined operationally in terms of sequences of operations. This paper gives another definition of serializability-in terms of sequences of states. It also shows how this definition can be used ...
    • Automated Analysis of Fault-Tolerance in Distributed Systems 

      Stoller, Scott D.; Fred B. Schneider Stoller, Scott D; Schneider, Fred B. (Cornell University, 2000-12-21)
      A method for automated analysis of fault-tolerance of distributed systems is presented. It is based on a stream model of computation augmented with approximation constructs, and this facilitates efficient analysis. Analyses ...
    • Automated Analysis of Fault-Tolerance in Distributed Systems 

      Stoller, Scott D.; Schneider, Fred B. (Cornell University, 1996-11)
      This paper describes a method for automated analysis of fault-tolerance properties of distributed systems. The framework is based on ideas from stream-processing semantics for networks of processes and abstract interpretation ...
    • Automated Stream-Based Analysis of Fault-Tolerance 

      Stoller, Scott; Schneider, Fred B. (Cornell University, 1998-06)
      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: ...
    • Avoiding the Undefined by Underspecification 

      Gries, David; Schneider, Fred B. (Cornell University, 1995-05)
      We use the appeal of simplicity and an aversion to complexity in selecting a method for handling partial functions in logic. We conclude that avoiding the undefined by using underspecifi- cation is the preferred choice.
    • Belief in Information Flow 

      Clarkson, Michael R.; Myers, Andrew C.; Schneider, Fred B. (Cornell University, 2005-02-10)
      Measurement of information flow requires a definition of leakage, which traditionally has been defined to occur when an attacker's uncertainty about secret data is reduced. We show that this uncertainty-based approach ...
    • Blueprint for a Science of Cybersecurity 

      Schneider, Fred B. (2011-05-24)
      A secure system must defend against all possible attacks--including those unknown to the defender. But defenders, having limited resources, typically develop defenses only for attacks they know about. New kinds of attacks ...
    • Broadcasts: A Paradigm for Distributed Programs 

      Schneider, Fred B. (Cornell University, 1980-10)
    • Byzantine Generals In Action: Implementing Fail-Stop Processors 

      Schneider, Fred B. (Cornell University, 1983-08)
      A fail-stop processor halts instead of performing an erroneous state transformation that might be visible to other processors, can detect whether another fail-stop processor has halted (due to a failure), and has a ...
    • COCA: A Secure Distributed On-line Certification Authority 

      Zhou, Lidong; Schneider, Fred B.; van Renesse, Robbert (Cornell University, 2000-12-08)
      COCA is a fault-tolerant and secure on-line certification authority that has been built and deployed both in a local area network and in the Internet. Replication is used to achieve availability; proactive recovery with ...
    • CODEX: A Robust and Secure Secret Distribution System 

      Marsh, Michael A.; Schneider, Fred B. (Cornell University, 2004-07-28)
      CODEX (COrnell Data EXchange) stores secrets for subsequent access by authorized clients. It also is a vehicle for exploring the generality of a relatively new approach to building distributed services that are both ...
    • Completeness and Incompleteness of Trace-Based Network Proof Systems 

      Widom, Jennifer; Gries, David; Schneider, Fred B. (Cornell University, 1986-07)
      Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two ...
    • Computability Classes for Enforcement Mechanisms 

      Hamlen, Kevin W.; Morrisett, Greg; Schneider, Fred B. (Cornell University, 2003-08-26)
      A precise characterization of those security policies enforceable by program rewriting is given. This characterization exposes and rectifies problems in prior work on execution monitoring, yielding a more precise ...
    • Concepts and Notations for Concurrent Programming 

      Andrews, Gregory R.; Schneider, Fred B. (Cornell University, 1982-09)
      Much has been learned in the last decade about concurrent programming. This paper identifies the major concepts and describes some of the more important language notations for writing concurrent programs. The roles of ...
    • Constraints: A Uniform Approach to Aliasing and Typing 

      Lamport, Leslie; Schneider, Fred B. (Cornell University, 1984-09)
      No abstract supplied.
    • A Conversation with Fred Schneider 

      Schneider, Fred B.; Gries, David (Internet-First University Press, 2015-09-09)
      Fred Schneider, an expert in concurrent and distributed systems and in computer and cybersecurity, shares insights about how his professional interests evolved, and provides sweeping views about how his field and department ...