Fred B. Schneider | Academic Influence

Fred B. Schneider's AcademicInfluence.com Rankings

Fred B. Schneider

Computer Science

#1013

World Rank

#1050

Historical Rank

#545

USA Rank

Database

#508

World Rank

#532

Historical Rank

#200

USA Rank

computer-science Degrees

Download Badge

Computer Science

Fred B. Schneider's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics Cornell University

Similar Degrees You Can Earn

Why Is Fred B. Schneider Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Fred Barry Schneider is an American computer scientist, based at Cornell University, where he is the Samuel B. Eckert Professor of Computer Science. He has published in numerous areas including science policy, cybersecurity, and distributed systems. His research is in the area of concurrent and distributed systems for high-integrity and mission-critical applications.

(See a Problem?)

Fred B. Schneider's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Implementing fault-tolerant services using the state machine approach: a tutorial (1990) (2634)
Enforceable security policies (2000) (1385)
Defining Liveness (1984) (1164)
A Theory of Graphs (1993) (960)
Refinement Calculus: A Systematic Introduction (1998) (916)
Fail-stop processors: an approach to designing fault-tolerant computing systems (1981) (880)
Concepts and Notations for Concurrent Programming (1983) (606)
Hypervisor-based fault tolerance (1995) (510)
Recognizing safety and liveness (2005) (502)
Chain Replication for Supporting High Throughput and Availability (2004) (462)
COCA: a secure distributed online certification authority (2002) (441)
A Logical Approach to Discrete Math (1993) (423)
The primary-backup approach (1993) (416)
SASI enforcement of security policies: a retrospective (1999) (404)
Hyperproperties (2008) (372)
IRM enforcement of Java stack inspection (2000) (352)
Byzantine generals in action: implementing fail-stop processors (1984) (322)
Replication management using the state-machine approach (1993) (285)
Computability classes for enforcement mechanisms (2006) (261)
Operating system support for mobile agents (1995) (244)
Trust in Cyberspace (1998) (202)
A Language-Based Approach to Security (2001) (200)
Towards Fault-Tolerant and Secure Agentry (1997) (188)
Understanding Protocols for Byzantine Clock Synchronization (1987) (173)
User Recovery and Reversal in Interactive Systems (1984) (158)
Synchronization in Distributed Programs (1982) (158)
A Theory of Sets (1993) (157)
Belief in information flow (2005) (142)
APSS: proactive secret sharing in asynchronous systems (2005) (140)
The ``Hoare Logic'' of CSP, and All That (1984) (136)
Inexact agreement: accuracy, precision, and graceful degradation (1985) (127)
Device Driver Safety Through a Reference Validation Mechanism (2008) (119)
What good are models and what models are good (1993) (119)
An introduction to the TACOMA distributed system. Version 1.0 (1995) (113)
The State Machine Approach: A Tutorial (1990) (111)
Quantifying information flow with beliefs (2009) (107)
Cryptographic support for fault-tolerant distributed computing (1996) (104)
Certified In-lined Reference Monitoring on .NET (2006) (99)
Fault-Tolerant Broadcasts (1984) (94)
Least Privilege and More (2003) (94)
Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985, Munich, Germany (1988) (91)
Logical attestation: an authorization architecture for trustworthy computing (2011) (90)
NAP: practical fault-tolerance for itinerant computations (1999) (87)
Primary-Backup Protocols: Lower Bounds and Optimal Implementations (1992) (82)
Nexus authorization logic (NAL): Design rationale and applications (2011) (81)
Proactive obfuscation (2010) (80)
Verifying temporal properties without temporal logic (1989) (80)
Pretending Atomicity (1989) (77)
Symmetry and similarity in distributed systems (1985) (72)
CODEX: a robust and secure secret distribution system (2004) (72)
A Paradigm for Reliable Clock Synchronization (1986) (71)
Tolerating malicious gossip (2003) (70)
Putting Time into Proof Outlines (1991) (69)
Using message passing for distributed programming: proof rules and disciplines (1984) (65)
Avoiding the Undefined by Underspecification (1995) (64)
Doctrine for Cybersecurity (2011) (63)
A TACOMA retrospective (2002) (58)
Quantification of Integrity (2010) (58)
The Monoculture Risk Put into Context (2009) (55)
Key Exchange Using 'Keyless Cryptography' (1983) (55)
Federated Identity Management Systems: A Privacy-Based Characterization (2013) (55)
Cybersecurity Education in Universities (2013) (53)
Peer-to-Peer Authentication with a Distributed Single Sign-On Service (2004) (52)
Blueprint for a Science of Cybersecurity (2011) (51)
Implementing trustworthy services using replicated state machines (2005) (50)
Independence from obfuscation: a semantic framework for diversity (2006) (47)
Vive La Différence: Paxos vs. Viewstamped Replication vs. Zab (2013) (45)
Nexus: a new operating system for trustworthy computing (2005) (42)
Optimal Primary-Backup Protocols (1992) (42)
Distributed Blinding for Distributed ElGamal Re-Encryption (2005) (41)
Fail-Stop Processors: An Approach to Designing Computing Systems (1983) (40)
Paradigms for Distributed Programs (1984) (39)
On concurrent programming (1997) (38)
Safety Without Stuttering (1986) (35)
Formal Foundation for Specification and Verification (1984) (34)
ViewpointProgram committee overload in systems (2009) (34)
Faster Possibility Detection by Combining Two Approaches (1995) (34)
An Introduction to the TACOMA Distributed System (2006) (33)
Equational Propositional Logic (1995) (32)
Proving Boolean Combinations of Deterministic Properties (1987) (32)
A formalization of priority inversion (1993) (31)
NetQuery: a knowledge plane for reasoning about network properties (2010) (30)
Distributed Blinding for ElGamal Re-encryption (2004) (29)
Building Trustworthy Systems: Lessons from the PTN and Internet (1999) (29)
Proving Nondeterministically Specified Safety Properties Using Progress Measures (1993) (28)
Supporting broad internet access to TACOMA (1996) (26)
Completeness and incompleteness of trace-based network proof systems (1987) (26)
Derivation of sequential, real-time, process-control programs (1991) (26)
Enforcing Privacy Policies with Meta-Code (2015) (26)
Accountability for Perfection (2009) (25)
Decomposing Properties into Safety and Liveness Using Predicate Logic. (1987) (25)
TEACHING MATH MORE EFFECTIVELY, THROUGH CALCULATIONAL PROOFS (1995) (23)
What TACOMA taught us (1999) (22)
Distributed Trust: Supporting Fault-tolerance and Attack-tolerance (2004) (20)
The Building Blocks of Consensus (2008) (20)
Spreading rumors cheaply, quickly, and reliably (2002) (20)
Open source in security: visiting the bizarre (2000) (20)
From the Editors: The Next Digital Divide (2004) (19)
IT Monoculture Security Risks and Defenses (2009) (18)
Constraints: a uniform approach to aliasing and typing (1985) (18)
Ancile: Enhancing Privacy for Ubiquitous Computing with Use-Based Privacy (2019) (17)
Abstractions for Fault Tolerance in Distributed Systems (1986) (16)
SGX Enforcement of Use-Based Privacy (2018) (16)
Adding the Everywhere Operator to Propositional Logic (1996) (16)
Master Keys for Group Sharing (1981) (15)
WAIF: Web of Asynchronous Information Filters (2003) (15)
Omni-Kernel: An Operating System Architecture for Pervasive Monitoring and Scheduling (2015) (14)
Overview of Cyber Security: A Crisis of Prioritization (2005) (14)
Ensuring Consistency in a Distributed Database System by Use of Distributed Semaphores (1979) (14)
Securing BGP Using External Security Monitors (2006) (13)
When Not All Bits Are Equal: Worth-Based Information Flow (2014) (13)
The HOCA Operating System Specifications (1983) (13)
Trace-based network proof systems: expressiveness and completeness (1987) (13)
Decomposing Properties into Safety and Liveness (1987) (13)
Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View" (1991) (13)
Verifying Safety Properties Using Non-deterministic Infinite-state Automata (1989) (12)
Reasoning about Programs by Exploiting the Environment (1994) (12)
Documentation for the CHIP Computer System (Version 1.1) (1983) (12)
JRIF: Reactive Information Flow Control for Java (2016) (11)
Derivation of a Distributed Algorithm for Finding Paths in Directed Networks (1986) (11)
Automated Analysis of Fault-Tolerance in Distributed Systems (1996) (10)
Chapter 7 : Replication Management using the State Machine Approach (1993) (10)
Formalizations Of Substitution Of Equals For Equals (1998) (9)
The CloudProxy Tao for Trusted Computing (2013) (9)
Verifying Programs That Use Causally-Ordered Message-Passing (1995) (9)
The fail-stop processor approach (1987) (9)
Instructor's manual: a logical approach to discrete math (1993) (9)
Critical (of) Issues in Real-Time Systems: A Position Paper (1988) (9)
Breaking-in Research (2013) (8)
Concepts for Concurrent Programming (1986) (8)
Developing a blueprint for a science of cybersecurity (8)
Understanding and using asynchronous message passing (Preliminary Version) (1982) (8)
Impediments with policy interventions to foster cybersecurity (2018) (8)
A New Approach to Teaching Mathematics (1994) (8)
Labeling-in Security (2009) (7)
Conditions for the Equivalence of Synchronous and Asynchronous Systems (1978) (7)
Quantication of Integrity (2010) (7)
More on Master Keys for Group Sharing (1981) (7)
Operating system support for mobile agents: position paper for 5th IEEE Workshop on Hot Topics in Operating Systems (1999) (7)
Verifying Temporal Properties without using Temporal Logic (2001) (7)
Hybrid Verification by Exploiting the Environment (1994) (6)
Critical Infrastructures You Can Trust: Where Telecommunications Fits (1998) (6)
On E. W. Dijkstra's position paper on “fairness:'' (1988) (6)
Language-Based Security for Malicious Mobile Code (2007) (6)
Secure systems conundrum (2002) (6)
A New Approach to Teaching (1994) (6)
Verifying Hyperproperties With TLA (2021) (6)
Costs of Security in the PFS File System (2012) (5)
NetQuery: a knowledge plane for reasoning about network properties (2011) (5)
in Distributed Programs (1982) (5)
Scheduling in Concurrent Pascal (1978) (5)
Priority Inversion and Its Prevention (1990) (5)
Trusted Computing in Context (2007) (5)
Multi-Verifier Signatures (2012) (5)
A Doctrinal Thesis (2011) (5)
Trustworthiness as a Limitation on Network Neutrality (2009) (5)
Network Neutrality versus Internet Trustworthiness? (2008) (5)
Interview - Fred B. Schneider on Distributed Computing (2000) (4)
It Depends on What You Pay (2005) (4)
RIF: Reactive information flow labels (2020) (4)
Beyond Traces and Independence (2011) (4)
Fine-Grained User Privacy from Avenance Tags (2014) (4)
Inside risks: evolving telephone networks (1999) (4)
Chapter 2 – Concepts and notations for concurrent programming* (1990) (4)
From Fault-tolerance to Attack Tolerance (2011) (4)
Critical (of) Issues in Real-Time Systems. (1988) (3)
Refinement for Fault-Tolerance: An Aircraft Hand-off Protocol (1994) (3)
Hypervisor-based fault tolerance (1995) (3)
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 10-12, 1987 (1987) (3)
Teaching Math More Effectively, Through the Design of Calculational Proofs (1994) (3)
Evolving Telephone Networks (1999) (3)
Broadcasts: A Paradigm for Distributed Programs (1980) (3)
Abstractions for Fault Tolerance in Distributed Systems (Invited Paper) (1986) (3)
Evolution vs. Intelligent Design in Consensus Protocols (2007) (2)
When not all bits are equal : Incorporating “ worth ” into information-flow measures (2013) (2)
Language-Based Security: What's Needed and Why (2001) (2)
Editorial: time for change (2000) (2)
Progress Measures for Verification Involving Nondeterminism (1990) (2)
On Language Restrictions to Ensure Deterministic Behavior in Concurrent Systems (1978) (2)
A Graphical Interface for CHIP (1996) (2)
Implementing insider defenses (2021) (2)
Mechanisms for Specifying Scheduling Policies (1979) (2)
NetQuery: A General-Purpose Channel for Reasoning about Network (2009) (2)
Avoiding the Undeened by Underspeciication (1995) (2)
Automated Stream-Based Analysis of Fault-Tolerance (1998) (2)
Inside risks: toward trustworthy networked information systems (1998) (2)
Credentials-Based Authorization: Evaluation and Implementation (2007) (2)
Using External Security Monitors to Secure BGP (2007) (2)
Detecting Distributed Termination When Processors Can Fail (1980) (2)
A Distributed Path Algorithm and Its Correctness Proof (1983) (2)
A Research Ecosystem for Secure Computing (2021) (1)
Beyond hacking: an SOS! (2010) (1)
A Role for Formal Methodists (1995) (1)
The Master Key Problem (1980) (1)
Time Out for Station Identification (2004) (1)
Credentials-based Authorization (2014) (1)
Nerio: Leader Election and Edict Ordering (2011) (1)
Nexus Operating System for Trustworthy Computing (2009) (1)
A Computer Scientist Musing about the DNC Hack (2016) (1)
Notes on proof outline logic (1996) (1)
Technology Scapegoats and Policy Saviors (2007) (1)
Technical Perspective: IronFleet simplifies proving safety and liveness properties (2017) (1)
Changes in distributed computing (1995) (1)
A Theory of Sequences (1993) (1)
THE TRAINSET RAILROAD SIMULATION. (1993) (1)
Enforceable Security Policies 1 (1)
Another Position Paper on "Fairness" (2016) (1)
On Restrictions to Ensure Reproducible Behavior in Concurrent Programs (1979) (1)
Mapping the Security Landscape: A Role for Language Techniques (2007) (1)
Privacy and Security Putting Trust in Security Engineering (2018) (1)
Fumbling the Future, Again (2010) (1)
Here Be Dragons (2006) (1)
Scheduler control over all resource consumption (2013) (1)
Putting It Together (1997) (0)
AFRL/Cornell Information Assurance Institute (2002) (0)
Language-Based Security for Extensible Systems (2004) (0)
Time Services (Dagstuhl Seminar 9611) (2021) (0)
Lifting Reference Monitors from the Kernel (2002) (0)
Relaxing the Proof Style (1993) (0)
Foundations and Support for Survivable Systems (2001) (0)
Fault tolerant computer system with shadow virtual processor (1997) (0)
Making a Science Out of an Art (2013) (0)
CIPIAF for Information Assurance Institute (2004) (0)
Design Principles for Secure Systems (2011) (0)
Textual Substitution, Equality, and Assignment (1993) (0)
Introduction (2005) (0)
An Assertional Characterization of Serializability (1989) (0)
On traditions in Marktoberdorf (1996) (0)
Corrigenda: “Concepts and notations for concurrent programs” (1983) (0)
Comet Observations [A62 Aichtal] (2004) (0)
Chapter 8 Implementing Trustworthy Services Using Replicated State Machines (0)
Lower Bounds for a Primary–Backup Implementation of a Bofo Service (2013) (0)
Predicates and Programming (1993) (0)
Formalizations of Substitution of Equals for Equals Substitution of Equals for Equals: If S Results from R by Substitution of Q For (1998) (0)
1 Putting Trust in Security Engineering (2018) (0)
From the Editors. (2019) (0)
Teaching Logic as a Tool (1994) (0)
Surveyors' forum: Notations for concurrent programming (1983) (0)
Multi-Verifier Signatures (2011) (0)
Relations and Functions (1993) (0)
Ancile (2019) (0)
JRIF : Reactive Information Flow Control for Java ∗ Technical Report (2015) (0)
Verifying Arbitrary Temporal Logic Properties (1997) (0)
Mobile Software-Agents (Dagstuhl Seminar 9742) (2021) (0)
Workshop Report : Security Risks from a Software Monoculture (2009) (0)
Schilb v. Kuebel: Reform Helps Cost Retention Provision Meet the Constitutional Requirements of Equal Protection and Due Process, 6 J. Marshall J. of Prac. & Proc. 204 (1972) (1972) (0)
On Concurrent Programming [Book Review] (1998) (0)
Network Security and the Need to Consider Provider Coordination in Network Access Policy (2007) (0)
A Theory of Integers (1993) (0)
Minor Planet Observations [A62 Aichtal] (2005) (0)
Three Surveys on Operating System Topics (1980) (0)
Safety Properties with Past Terms (1997) (0)
Putting trust in security engineering (2018) (0)
Changing of the guard (1990) (0)
Fault-Tolerant and Real-Time Distributed Computing. (1993) (0)
Beyond Labels: Permissiveness for Dynamic Information Flow Enforcement (2019) (0)
REACHING AGREEMENT A Fundamental Task — Even in Distributed Computer Systems (2013) (0)
These lessons are largely ignored in today ’ s discussions about how to reduce the frequency and costs of identity Technology Scapegoats and Policy Saviors (0)
Programming languages in security: keynote (2013) (0)
Programming with Fine-Grained Atomic Actions (1997) (0)
Trust in Security-Policy Enforcement Mechanisms (2005) (0)
Causal network telemetry (2022) (0)
Semaphores, Locks, and Conditional Critical Regions (1997) (0)
Towards Derivation of Real-Time Process-Control Programs (1990) (0)
Hilbert-style Proofs (1993) (0)
15 . WAIF : Web of Asynchronous Information Filters ∗ (2003) (0)
Safety Properties: Invariance (1997) (0)
Security Risks from a Software Monoculture (2008) (0)
Report Dagstuhl Seminar on Time Services Schloß Dagstuhl, March 11. – March 15. 1996 (1997) (0)
Thrifty execution of task pipelines (1985) (0)
Containment and Integrity for Mobile Code (2004) (0)
Mobile Agents and Systems Principles (1999) (0)
Applications of Propositional Calculus (1993) (0)
Personal Keys, Group Keys and Master Keys (1980) (0)
Least Privilege Which Policy to Enforce? (2001) (0)
Simpler proofs for concurrent reading and writing (1990) (0)
A Conversation with Fred Schneider (2015) (0)
Verifying Temporal Temporal Logic Properties without (1989) (0)
History and Context for Defining Liveness: Winner 2018 Edsger W. Dijkstra Prize (2018) (0)
Trust in a Principled Filesystem (2014) (0)
Message Passing and Distributed Programming (1997) (0)
Towards a Science Base for Cybersecurity (2016) (0)
Programming Methodology (2003) (0)
It Monoculture Vulnerabilities and Defenses (2009) (0)
Bolivian Petroleum Systems: Paradigm Shifts (2018) (0)
Teaching as a logic tool (abstract) (1995) (0)
Concurrency and Interference (1997) (0)
Notation and Logic for Sequential Programming (1997) (0)

This paper list is powered by the following services:

Other Resources About Fred B. Schneider

en.wikipedia.org

What Schools Are Affiliated With Fred B. Schneider?

Fred B. Schneider is affiliated with the following schools: