WorldCat Identities

Schneider, Fred B.

Overview
Works: 96 works in 230 publications in 1 language and 3,609 library holdings
Roles: Editor
Classifications: TK5105.59, 384.3
Publication Timeline
Key
Publications about  Fred B Schneider Publications about Fred B Schneider
Publications by  Fred B Schneider Publications by Fred B Schneider
Most widely held works by Fred B Schneider
Trust in cyberspace ( )
6 editions published between 1997 and 1999 in English and held by 2,104 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."--BOOK JACKET
A logical approach to discrete math by David Gries ( Book )
23 editions published between 1993 and 2010 in English and Undetermined and held by 601 WorldCat member libraries worldwide
This text attempts to change the way logic and discrete math are taught in computer science and mathematics. While many books treat logic simply as another topic of study, this book's uniqueness is its willingness to take it one step further. In the book, logic is treated as a basic tool, to be applied in essentially every other area. "This is a rather extraordinary book, and deserves to be read by everyone involved in computer science and - perhaps more importantly - software engineering. I recommend it highly. The book will be of value not only to beginning students, but also to hardened programmers with many years of experience - in Fortran, Cobol, C, C++, or whatever. If the book is taken seriously, the rigor that it unfolds and the clarity of its concepts could have a significant impact on the way in which software is conceived and developed." -Peter G. Neumann
On concurrent programming by Fred B Schneider ( Book )
11 editions published in 1997 in English and held by 252 WorldCat member libraries worldwide
Concurrent computing is gaining ground in interest as it becomes increasingly feasible to implement distributed computing across networks of workstations. This book, by one of the subject's leading figures, provides a comprehensive survey of the subject beginning with proposotional logic and concluding with concurrent programming. It is based on graduate courses taught at Cornell University and is designed to be used as a graduate text. There are exercises at the end of each chapter to extend and illustrate the main themes covered. Professor Schneier emphasizes the use of formal methods and assertional reasoning using notation and paradigms drawn from programming to drive the exposition. As a result, all those interested in studying concurrent computing will find this to be an invaluable approach to the subject
Putting time into proof outlines by Fred B Schneider ( Book )
8 editions published between 1991 and 1993 in English and held by 141 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 A Marzullo ( Book )
5 editions published in 1994 in English and held by 75 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 )
4 editions published in 1991 in English and held by 72 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 60 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 held by 31 WorldCat member libraries worldwide
Pretending atomicity by Leslie Lamport ( Book )
6 editions published in 1989 in English and Undetermined and held by 21 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
Elements of computation theory by Arindama Singh ( )
2 editions published in 2009 in English and held by 14 WorldCat member libraries worldwide
Practical introduction to computer architecture by Daniel Stephen Page ( )
1 edition published in 2009 in English and held by 10 WorldCat member libraries worldwide
Verifying temporal properties without using temporal logic by Bowen Lewis Alpern ( Book )
5 editions published between 1985 and 1987 in English and held by 9 WorldCat member libraries worldwide
A new approach for proving temporal properties of concurrent programs is presented. The approach does not use temporal logic. To show that a program satisfies a given temporal property, the property is first decomposed into proof obligations. These obligations are then discharge by devising suitable invariant assertions and variant functions for the program. The approach is quite general - it handles a superset of the properties that can be expressed in linear-time temporal logic. Keywords: Computer program verification. (Author)
Abstractions for fault tolerance in distributed systems by Fred B Schneider ( Book )
3 editions published in 1986 in English and held by 8 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
Safety without stuttering by Bowen Lewis Alpern ( Book )
3 editions published in 1985 in English and held by 6 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)
Concepts and notations for concurrent programming by Gregory R Andrews ( Book )
3 editions published in 1982 in English and Undetermined and held by 6 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
Completeness and incompleteness of trace-based network proof systems by Jennifer Widom ( Book )
3 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
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 examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented
Monographs in computer science ( )
in English and held by 6 WorldCat member libraries worldwide
Using message passing for distributed programming : proof rules and disciplines by Richard D Schlichting ( Book )
5 editions published in 1982 in English and Undetermined and held by 6 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
Priority inversion and its prevention by Özalp Babaoğlu ( Book )
3 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."
Trace-based network proof systems : expressiveness and completeness by Jennifer Widom ( Book )
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We then consider the expressiveness required of any trace logic that encodes these extensions."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.50 (from 0.37 for Trust in c ... to 0.92 for Putting ti ...)
Alternative Names
Schneider, F. B.
シュナイダー, F. B
Languages
English (99)
Covers