Schneider, Fred B.
Overview
Works:  126 works in 308 publications in 1 language and 3,850 library holdings 

Roles:  Author, Editor 
Classifications:  QA267.7, 510 
Publication Timeline
.
Most widely held works by
Fred B Schneider
A logical approach to discrete math by
David Gries(
Book
)
23 editions published between 1993 and 2010 in English and Undetermined and held by 592 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
23 editions published between 1993 and 2010 in English and Undetermined and held by 592 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
Trust in cyberspace(
Book
)
7 editions published between 1997 and 1999 in English and held by 386 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
7 editions published between 1997 and 1999 in English and held by 386 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 held by 242 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
11 editions published in 1997 in English and held by 242 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
)
10 editions published between 1991 and 1993 in English and held by 156 WorldCat member libraries worldwide
Abstract: "A logic for reasoning about timing properties of concurrent programs is presented. The logic is based on Hoarestyle 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."
10 editions published between 1991 and 1993 in English and held by 156 WorldCat member libraries worldwide
Abstract: "A logic for reasoning about timing properties of concurrent programs is presented. The logic is based on Hoarestyle 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 faulttolerance an aircraft handoff protocol by
Keith Marzullo(
Book
)
7 editions published in 1994 in English and held by 81 WorldCat member libraries worldwide
Abstract: "Part of the Advanced Automation System (AAS) for air traffic control is a protocol to permit flight handoff from one air traffic controller to another. The protocol must be faulttolerant and, therefore, is subtle  an ideal candidate for the application of formal methods. This paper describes a formal method for deriving faulttolerant protocols that is based on refinement and proof outlines. The AAS handoff protocol was actually derived using this method; that derivation is given."
7 editions published in 1994 in English and held by 81 WorldCat member libraries worldwide
Abstract: "Part of the Advanced Automation System (AAS) for air traffic control is a protocol to permit flight handoff from one air traffic controller to another. The protocol must be faulttolerant and, therefore, is subtle  an ideal candidate for the application of formal methods. This paper describes a formal method for deriving faulttolerant protocols that is based on refinement and proof outlines. The AAS handoff protocol was actually derived using this method; that derivation is given."
Derivation of sequential, realtime, processcontrol programs by
Keith Marzullo(
Book
)
6 editions published in 1991 in English and held by 77 WorldCat member libraries worldwide
Abstract: "The use of weakestprecondition predicate transformers in the derivation of sequential, processcontrol software is discussed. Only one extension to Dijkstra's calculus for deriving ordinary sequential programs was found to be necessary: functionvalued auxiliary variables. These auxiliary variables are needed for reasoning about states of a physical process that exist during program transitions."
6 editions published in 1991 in English and held by 77 WorldCat member libraries worldwide
Abstract: "The use of weakestprecondition predicate transformers in the derivation of sequential, processcontrol software is discussed. Only one extension to Dijkstra's calculus for deriving ordinary sequential programs was found to be necessary: functionvalued 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 39 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 selfcontained 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
3 editions published in 2008 in English and held by 39 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 selfcontained 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 35 WorldCat member libraries worldwide
4 editions published in 1985 in English and Undetermined and held by 35 WorldCat member libraries worldwide
Pretending atomicity by
Leslie Lamport(
Book
)
7 editions published in 1989 in English and Undetermined and held by 20 WorldCat member libraries worldwide
We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarsergrained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlockfreedom. Our theorem applies to all safety properties
7 editions published in 1989 in English and Undetermined and held by 20 WorldCat member libraries worldwide
We present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarsergrained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlockfreedom. Our theorem applies to all safety properties
Verifying temporal properties without using temporal logic by
Bowen Lewis Alpern(
Book
)
6 editions published between 1985 and 1987 in English and held by 10 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 lineartime temporal logic. Keywords: Computer program verification. (Author)
6 editions published between 1985 and 1987 in English and held by 10 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 lineartime 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 faulttolerant 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
3 editions published in 1986 in English and held by 8 WorldCat member libraries worldwide
Abstractions useful in faulttolerant 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 Undetermined 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
5 editions published in 1982 in English and Undetermined 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
Recognizing safety and liveness by
Bowen Lewis Alpern(
Book
)
4 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
Formal characterizations for safety properties and liveness properties are given in terms of the structure of the Buchi automaton that specifies the property. The characterizations permit a property to be decomposed into a safety property and a liveness property whose conjunction is the original. The characterizations also give insight into techniques required to prove a large class of safety and liveness properties
4 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
Formal characterizations for safety properties and liveness properties are given in terms of the structure of the Buchi automaton that specifies the property. The characterizations permit a property to be decomposed into a safety property and a liveness property whose conjunction is the original. The characterizations also give insight into techniques required to prove a large class of safety and liveness properties
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 lowpriority task causes execution of a higherpriority task to be delayed. The possibility of priority inversion complicates the analysis of systems that use prioritybased schedulers because priority inversions invalidate the assumption that a task can be delayed only by higherpriority tasks. This paper formalizes priority inversion and gives sufficient conditions as well as some new protocols for preventing priority inversions."
4 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide
Abstract: "A priority inversion occurs when a lowpriority task causes execution of a higherpriority task to be delayed. The possibility of priority inversion complicates the analysis of systems that use prioritybased schedulers because priority inversions invalidate the assumption that a task can be delayed only by higherpriority tasks. This paper formalizes priority inversion and gives sufficient conditions as well as some new protocols for preventing priority inversions."
Three surveys on operating system topics by
Gregory R Andrews(
Book
)
4 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
Tracebased network proof systems : expressiveness and completeness by
David Gries(
Book
)
4 editions published in 1989 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We consider incomplete tracebased 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."
4 editions published in 1989 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We consider incomplete tracebased 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."
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
5 editions published in 1982 in English and Undetermined and held by 6 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
Computer architecture, which underpins computer science, is a topic in which "getting things done" is paramount: The ability to understand tradeoffs before selecting between and implementing wellconsidered design options is often as important as the study of those options at a more theoretical level. This easytofollow A Practical Introduction to Computer Architecture 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 "handson" modelling and experimenting with digital logic and processor design. This unique approach encourages readers to derive their own conclusions via experimentation, enabling them to discover for themselves the fundamental and exciting topics of computer architecture. The book is divided into three parts, covering each of the three levels of abstraction: the digital logic layer, the instruction set and microarchitecture layer, and the hardware/software interface. The first part deals with the basic tools and techniques which underpin the rest of the book, whereas the second part deals with the broad topic of processor design and implementation. The final part bridges the gap between hardware and software by examining the programming tools and operatingsystem concepts that support the development and execution of programs. Topics and features: Includes a wideranging introductory chapter, familiarising the reader with both the subject and the book?s contents Outlines basic methods for evaluating processors, with a focus on performance Investigates advanced topics in processor design, such as superscalar and vector processors Presents a detailed description of a development toolchain Provides a standalone tutorial on using SPIM, a MIPS32 simulator Focuses on aspects of compilers which are closely tied to the processor, covering register allocation, instruction selection and scheduling Explores real implementations of concepts such as scheduling and interrupt handling Examines the concept of efficient programming Concludes every chapter with a set of example problems, and contains an appendix that discusses solutions Supplies additional supportive material, such as example source code and electronic lecture slides, at http://www.cs.bris.ac.uk/home/page/teaching/pica.html This practical, readerfriendly textbook has been written with undergraduates in mind, and is suitable for selfstudy. The book can also be used by postgraduate students as a supportive reference for use in combination with more specialised textbooks. Dr. Dan Page is a lecturer at the University of Bristol, affiliated with both the Languages and Architecture Group and the Cryptography and Information Security Group. He was one of the founders of Identum (now part of Trend Micro), which is involved in delivering cryptographic expertise and products to industrial customers
1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide
Computer architecture, which underpins computer science, is a topic in which "getting things done" is paramount: The ability to understand tradeoffs before selecting between and implementing wellconsidered design options is often as important as the study of those options at a more theoretical level. This easytofollow A Practical Introduction to Computer Architecture 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 "handson" modelling and experimenting with digital logic and processor design. This unique approach encourages readers to derive their own conclusions via experimentation, enabling them to discover for themselves the fundamental and exciting topics of computer architecture. The book is divided into three parts, covering each of the three levels of abstraction: the digital logic layer, the instruction set and microarchitecture layer, and the hardware/software interface. The first part deals with the basic tools and techniques which underpin the rest of the book, whereas the second part deals with the broad topic of processor design and implementation. The final part bridges the gap between hardware and software by examining the programming tools and operatingsystem concepts that support the development and execution of programs. Topics and features: Includes a wideranging introductory chapter, familiarising the reader with both the subject and the book?s contents Outlines basic methods for evaluating processors, with a focus on performance Investigates advanced topics in processor design, such as superscalar and vector processors Presents a detailed description of a development toolchain Provides a standalone tutorial on using SPIM, a MIPS32 simulator Focuses on aspects of compilers which are closely tied to the processor, covering register allocation, instruction selection and scheduling Explores real implementations of concepts such as scheduling and interrupt handling Examines the concept of efficient programming Concludes every chapter with a set of example problems, and contains an appendix that discusses solutions Supplies additional supportive material, such as example source code and electronic lecture slides, at http://www.cs.bris.ac.uk/home/page/teaching/pica.html This practical, readerfriendly textbook has been written with undergraduates in mind, and is suitable for selfstudy. The book can also be used by postgraduate students as a supportive reference for use in combination with more specialised textbooks. Dr. Dan Page is a lecturer at the University of Bristol, affiliated with both the Languages and Architecture Group and the Cryptography and Information Security Group. He was one of the founders of Identum (now part of Trend Micro), which is involved in delivering cryptographic expertise and products to industrial customers
Elements of computation theory by
Arindama Singh(
)
1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2009 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 National Research Council (U.S.). Committee on Information Systems Trustworthiness
 Gries, David Author Editor
 Marzullo, Keith Author
 United States National Aeronautics and Space Administration
 Bloom, Bard
 Dehn, Jon
 Budhiraja, Navin
 CORNELL UNIV ITHACA NY DEPT OF COMPUTER SCIENCE
 Vitányi, Paul
 Li, Ming Author
Useful Links
Associated Subjects
Abstraction Air traffic controlComputer programs Algorithms Coding theory Computable functions Computational complexity Computer architecture Computer engineering Computer network architectures Computer networksSecurity measures Computer programming Computer programs Computer programsVerification Computer science Computer software Electronic data processingDistributed processing Faulttolerant computing Information theory InternetSecurity measures Kolmogorov complexity Logic, Symbolic and mathematical Machine theory Mathematical statistics Mathematics Operating systems (Computers) Optical pattern recognition Parallel processing (Electronic computers) Parallel programming (Computer science) Pattern perception Process controlComputer programs Production schedulingData processing Proof theory Realtime programming Robots Sequential processing (Computer science) Software engineering Statistics Synchronization Telecommunication policy United States
Alternative Names
Fred B. Schneider American computer scientist
Schneider, F. B.
シュナイダー, F. B
Languages
Covers