Fred B. Schneider

From MaRDI portal
(Redirected from Fred B. Schneider)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Evoking Whitehead's dictum2024-10-28Paper
Faster possibility detection by combining two approaches
Distributed Algorithms
2023-12-01Paper
Tolerating malicious gossip
Distributed Computing
2020-12-04Paper
JRIF: reactive information flow control for Java2020-03-03Paper
Reasoning about programs by exploiting the environment
Automata, Languages and Programming
2019-04-29Paper
Quantification of integrity
Mathematical Structures in Computer Science
2016-07-27Paper
Multi-verifier signatures
Journal of Cryptology
2012-07-03Paper
The Building Blocks of Consensus
Distributed Computing and Networking
2008-03-06Paper
Automated analysis of fault-tolerance in distributed systems
Formal Methods in System Design
2006-02-20Paper
scientific article; zbMATH DE number 1950678 (Why is no real title available?)2003-07-17Paper
A TACOMA retrospective
Software: Practice and Experience
2003-02-04Paper
scientific article; zbMATH DE number 1832229 (Why is no real title available?)2002-11-19Paper
Adding the everywhere operator to propositional logic
Journal Of Logic And Computation
1999-02-04Paper
Teaching Math More Effectively, Through Calculational Proofs
The American Mathematical Monthly
1997-11-09Paper
scientific article; zbMATH DE number 1049169 (Why is no real title available?)1997-08-17Paper
Equational propositional logic
Information Processing Letters
1997-02-28Paper
scientific article; zbMATH DE number 910704 (Why is no real title available?)1997-01-19Paper
scientific article; zbMATH DE number 910720 (Why is no real title available?)1996-08-29Paper
scientific article; zbMATH DE number 789390 (Why is no real title available?)1995-08-23Paper
Verifying programs that use causally-ordered message-passing
Science of Computer Programming
1995-07-04Paper
Proving nondeterministically specified safety properties using progress measures
Information and Computation
1994-03-24Paper
Verifying temporal properties without temporal logic
ACM Transactions on Programming Languages and Systems
1989-01-01Paper
Recognizing safety and liveness
Distributed Computing
1987-01-01Paper
Derivation of a distributed algorithm for finding paths in directed networks
Science of Computer Programming
1986-01-01Paper
Safety without stuttering
Information Processing Letters
1986-01-01Paper
scientific article; zbMATH DE number 3958701 (Why is no real title available?)1986-01-01Paper
Thrifty execution of task pipelines
Acta Informatica
1985-01-01Paper
Defining liveness
Information Processing Letters
1985-01-01Paper
The ``Hoare Logic'' of CSP, and All That
ACM Transactions on Programming Languages and Systems
1984-01-01Paper
Using message passing for distributed programming: proof rules and disciplines
ACM Transactions on Programming Languages and Systems
1984-01-01Paper
Fault-tolerant broadcasts
Science of Computer Programming
1984-01-01Paper
scientific article; zbMATH DE number 3814957 (Why is no real title available?)1983-01-01Paper
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems
1982-01-01Paper
Conditions for the Equivalence of Synchronous and Asynchronous Systems
IEEE Transactions on Software Engineering
1978-01-01Paper


Research outcomes over time


This page was built for person: Fred B. Schneider