WorldCat Identities

Schneider, Fred B.

Works: 124 works in 355 publications in 3 languages and 4,264 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Other
Classifications: QA267.7, 510
Publication Timeline
Most widely held works by Fred B Schneider
A logical approach to discrete math by David Gries( Book )

28 editions published between 1993 and 2010 in 3 languages and held by 607 WorldCat member libraries worldwide

Mathematics of Computing -- Discrete Mathematics
Trust in cyberspace by National Research Council (U.S.)( Book )

11 editions published between 1997 and 1999 in English and held by 373 WorldCat member libraries worldwide

"This book provides an assessment of the current state of the art for building trustworthy networked information systems. It proposes directions for research in computer and network security, software technology, and system architecture. In addition, it assesses current technical and market trends in order to better inform public policy as to where progress is likely and where incentives could help."--Jacket
On concurrent programming by Fred B Schneider( Book )

11 editions published in 1997 in English and Italian and held by 252 WorldCat member libraries worldwide

Formal Logic - Temporal Logic - Notation and Logic for Sequential Programming - Concurrency and Interference - Safety Properties: Invariance - Safety Properties with Past Terms - Verifying Arbitrary Temporal Logic Properties - Programming with Fine-Grained Atomic Actions - Semaphores, Locks, and Conditional Critical Regions - Message Passing and Distributed Programming - Putting It Together
Putting time into proof outlines by Fred B Schneider( Book )

10 editions published between 1991 and 1993 in English and held by 161 WorldCat member libraries worldwide

Abstract: "A logic for reasoning about timing properties of concurrent programs is presented. The logic is based on Hoare-style proof outlines and can handle maximal parallelism as well as certain resource- constrained execution environments. The correctness proof for a mutual exclusion protocol that uses execution timings in a subtle way illustrates the logic in action. A soundness proof using structural operational semantics is outlined in the appendix."
Refinement for fault-tolerance : an aircraft hand-off protocol by Keith Marzullo( Book )

7 editions published in 1994 in English and held by 82 WorldCat member libraries worldwide

Abstract: "Part of the Advanced Automation System (AAS) for air- traffic control is a protocol to permit flight hand-off from one air- traffic controller to another. The protocol must be fault-tolerant and, therefore, is subtle -- an ideal candidate for the application of formal methods. This paper describes a formal method for deriving fault-tolerant protocols that is based on refinement and proof outlines. The AAS hand-off protocol was actually derived using this method; that derivation is given."
Derivation of sequential, real-time, process-control programs by Keith Marzullo( Book )

6 editions published in 1991 in English and held by 80 WorldCat member libraries worldwide

Abstract: "The use of weakest-precondition predicate transformers in the derivation of sequential, process-control software is discussed. Only one extension to Dijkstra's calculus for deriving ordinary sequential programs was found to be necessary: function-valued auxiliary variables. These auxiliary variables are needed for reasoning about states of a physical process that exist during program transitions."
An introduction to Kolmogorov complexity and its applications by Ming Li( )

3 editions published in 2008 in English and held by 48 WorldCat member libraries worldwide

Written by two experts in the field, this book is ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. It is self-contained in that it contains the basic requirements from mathematics and computer science. Included are also numerous problem sets, comments, source references, and hints to solutions of problems, as well as a great deal of new material not included in the first edition
Distributed systems : methods and tools for specification : an advanced course by Manfred Paul( )

4 editions published in 1985 in English and Undetermined and held by 40 WorldCat member libraries worldwide

Pretending atomicity by Leslie Lamport( Book )

9 editions published in 1989 in English and Undetermined and held by 22 WorldCat member libraries worldwide

We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties
Verifying temporal properties without using temporal logic by Bowen Lewis Alpern( Book )

7 editions published between 1985 and 1987 in English and held by 11 WorldCat member libraries worldwide

An approach to proving temporal properties of concurrent programs that does not use temporal logic as an inference system is presented. The approach is based on using Buchi automata to specify properties. To show that a program satisfies a given property, proof obligations are derived from the Buchi automaton for that property. These obligations are discharged by devising suitable invariant assertions and variant functions for the program. The approach is shown to be sound and relatively complete. A mutual exclusion protocol illustrates its application
Abstractions for fault tolerance in distributed systems by Fred B Schneider( Book )

4 editions published in 1986 in English and held by 9 WorldCat member libraries worldwide

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 concurrent programming. Among the abstractions discussed are agreement, order, failure detection, and stable storage
Concepts and notations for concurrent programming by Gregory R Andrews( Book )

5 editions published in 1982 in English and held by 8 WorldCat member libraries worldwide

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 processes, communication and syhchronization are discussed from both an operational and an axiomatic viewpoint. Language notations for expressing concurrent execution and for specifying process interaction are surveyed. Synchronization primitives based on shared variables and on message passing are described. Finally, three general classes of concurrent programming languages are identified and compared
Using message passing for distributed programming : proof rules and disciplines by Richard D Schlichting( Book )

7 editions published in 1982 in English and held by 8 WorldCat member libraries worldwide

Inference rules are derived for proving partial correctness of concurrent programs that use message passing. These rules extend the notion of a satisfaction proof, first proposed for proving correctness of programs that use synchronous message-passing, to asynchronous message-passing, rendezvous, and remote procedures. Two types of asynchronous message-passing are considered: unreliable datagrams and reliable virtual circuits. The proof rules show how interference can arise and be controlled
Safety without stuttering by Bowen Lewis Alpern( Book )

4 editions published in 1985 in English and held by 7 WorldCat member libraries worldwide

A new formalization of safety properties is given. The formalization agrees with the informal definition - that a safety property stipulates that some bad thing doesn't happen during execution - for properties that are not invariant under stuttering, as well as for properties that are. Keywords: Concurrent programming. (Author)
Priority inversion and its prevention by Özalp Babaoğlu( Book )

4 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide

Abstract: "A priority inversion occurs when a low-priority task causes execution of a higher-priority task to be delayed. The possibility of priority inversion complicates the analysis of systems that use priority-based schedulers because priority inversions invalidate the assumption that a task can be delayed only by higher-priority tasks. This paper formalizes priority inversion and gives sufficient conditions as well as some new protocols for preventing priority inversions."
Language-Based Security for Malicious Mobile Code( Book )

7 editions published between 2002 and 2007 in English and held by 3 WorldCat member libraries worldwide

This report summarizes progress over the past year in developing language-based technologies for defending software systems against attacks from mobile code and system extensions. The approach promises to support a wide range of flexible, finegrained access-control and information-flow policies. During the past year, the authors developed a more refined characterization of what policies can be enforced using reference monitors. This new work extends earlier work by Schneider by taking into account the limits of computability. Specifically, they developed a model based on standard Turing machines, adapted Schneider's criteria for enforceable security policies, and introduced computability requirements. They also integrated static analysis and program rewriting into the model. By providing this unifying model, and by basing it on Turing machines, they were able to compare the relative power of the various enforcement mechanisms, and to relate them to standard computability results. For instance, it was relatively easy to show that the class of policies precisely supported by static analysis could also be supported by both reference monitors and by program rewriting. In addition, they found that introducing a computability requirement on reference monitors was necessary, but not sufficient, for precise characterization of the class of policies realizable by reference monitors. And they identified a new property, which they call "punctuality," that provides a more accurate upper bound on the power of reference monitors. Most importantly, they were able to show that the class of policies enforceable through rewriting does not correspond to any class of the Kleene hierarchy, which shows that rewriting truly is a powerful security enforcement technique. A list of 28 publications supported under this contract is included
Objects and systems : principled design with implementations in C++ and Java by Bernard P Zeigler( )

1 edition published in 1997 in English and held by 0 WorldCat member libraries worldwide

The author's aim in this textbook is to provide students with a clear understanding of the relationship between the principles of object-oriented programming and software engineering. Professor Zeigler takes an approach based on state representation to formal specification. Consequently, this book is unique through its - emphasis on formulating primitives from which all other functionality can be built; - integral use of a semi-formal behaviour specification language based on state transition concepts; -differentiation between behaviour and implementation; -a reusable heterogeneous container class library; -ability to show the elegance and power of ensemble methods with non-trivial examples. As a result, students studying software engineering will find this a distinctive and valuable approach to programming and systems engineering
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing : Vancouver, British Columbia, Canada, August 10-12, 1987 by Fred B Schneider( )

2 editions published in 1987 in English and held by 0 WorldCat member libraries worldwide

Elements of computation theory by Arindama Singh( )

1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide

A practical introduction to computer architecture by Daniel Stephen Page( )

1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide

Blends traditional teaching approaches with the use of mathematics, together with the use of a hardware description language (Verilog) and a concrete processor (MIPS32) as vehicles for "hands-on" modelling and experimenting with digital logic and processor design -- from cover
moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.46 (from 0.07 for Trust in c ... to 0.95 for Language-B ...)

A logical approach to discrete math
Alternative Names
Fred B. Schneider American computer scientist

Fred B. Schneider informaticien américain

Schneider, F. B.

シュナイダー, F. B

Trust in cyberspaceOn concurrent programmingAn introduction to Kolmogorov complexity and its applicationsDistributed systems : methods and tools for specification : an advanced courseElements of computation theory