Here, one of the leading figures in the field provides a comprehensive survey of the subject, beginning with prepositional logic and concluding with concurrent programming. It is based on graduate courses taught at Cornell University and is designed for use as a graduate text. Professor Schneier emphasises the use of formal methods and assertional reasoning using notation and paradigms drawn from programming to drive the exposition, while exercises at the end of each chapter extend and illustrate the main themes covered. As a result, all those interested in studying concurrent computing will find this an invaluable approach to the subject.
FREE Two-Day Shipping for Students. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
8 of 11 people found the following review helpful:
5.0 out of 5 stars
Concurrent programming is very risky!,
By
This review is from: On Concurrent Programming (Texts in Computer Science) (Hardcover)
< One of the most insidious sources of programming problems in the RISKS archives involves concurrent programming. Synchronization, locking, message passing, and other tight-coupling mechanisms are extremely difficult to do properly. Programming languages and operating systems are not necessarily much help by themselves. Fred Schneider has put together a wonderful book on how to do concurrent programming correctly. Whereas the book is ideal for a one-semester course (and more), it is also very valuable as a reference work. It should be read by everyone deeply involved in writing critical programs. Although its focus is strongly on formal methods, I have long claimed that formal methods can be enormously helpful if you are really concerned about correctness in concurrency, for which most unproved algorithms tend to have flaws (and a few ``proved'' ones may also). Furthermore, the implementations of such algorithms are always in question, and formal methods can help significantly there as well. [From the Risks Forum, vol 19 no 51]
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
A concurrent program consists of processes and shared objects. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
proof outline logic, guard evaluation action, conditional atomic action, split binary semaphores, valid proof outline, proof outline invariant, anchored sequence, enabled atomic action, interlock instructions, new proof outline, program variable axioms, proving interference freedom, proving eventualities, active control points, following proof outline, single atomic statement, exit control point, unconditional fairness, reliable virtual circuit, conditional critical regions, binary ordering relation, semaphore method, single atomic action, ticket protocol, control predicates Key Phrases - Capitalized Phrases (CAPs): (learn more)
Predicate Logic, Proof Outline Logic, Propositional Logic, Induction Rule, Safety Consequence Rule, Control Axiom, Avoiding Interference, Rule of Consequence, Exclusion of Configurations Rule, Auxiliary Variable Deletion Rule, Substitution of Equals, Modus Ponens, Entry Nonblocking, Memory Atomicity, Derived Term Expansion Rule, Property Rule, Distributed Program Restriction, Weakly Fair Helpful Actions, Consequent-Weakening Law, Decomposition Rule, Interference Freedom Condition, Distributive Laws, Triple Rule, Antecedent-Strengthening Law, Antimonotonicity Rule New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
A concurrent program consists of processes and shared objects. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
proof outline logic, guard evaluation action, conditional atomic action, split binary semaphores, valid proof outline, proof outline invariant, anchored sequence, enabled atomic action, interlock instructions, new proof outline, program variable axioms, proving interference freedom, proving eventualities, active control points, following proof outline, single atomic statement, exit control point, unconditional fairness, reliable virtual circuit, conditional critical regions, binary ordering relation, semaphore method, single atomic action, ticket protocol, control predicates Key Phrases - Capitalized Phrases (CAPs): (learn more)
Predicate Logic, Proof Outline Logic, Propositional Logic, Induction Rule, Safety Consequence Rule, Control Axiom, Avoiding Interference, Rule of Consequence, Exclusion of Configurations Rule, Auxiliary Variable Deletion Rule, Substitution of Equals, Modus Ponens, Entry Nonblocking, Memory Atomicity, Derived Term Expansion Rule, Property Rule, Distributed Program Restriction, Weakly Fair Helpful Actions, Consequent-Weakening Law, Decomposition Rule, Interference Freedom Condition, Distributive Laws, Triple Rule, Antecedent-Strengthening Law, Antimonotonicity Rule New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 45
books:
See all 45 books this book cites
25
books
cite this book:
See all 25 books citing this book
- Communicating Sequential Processes (Prentice Hall International Series in Computing Science) by C.A.R. Hoare on 4 pages
- Temporal Logic (Library of exact philosophy) by Nicholas Rescher on page 83, and Back Matter
- A calculus of communicating systems (Lecture notes in computer science) by R Milner on page 434, and Back Matter
- Verification of Sequential and Concurrent Programs (Texts in Computer Science) by Krzysztof R. Apt in Front Matter, and Back Matter
- Current Trends in Concurrency (Lecture Notes in Computer Science) by J. W. De Bakker in Back Matter (1), and Back Matter (2)
See all 45 books this book cites
- Software Reliability Methods (Texts in Computer Science) by Doron A. Peled on page 213, Back Matter (1), and Back Matter (2)
- Concurrency: State Models and Java Programs by Jeff Magee on page 10, and Back Matter
- Lectures on Petri Nets II: Applications: Advances in Petri Nets (Lecture Notes in Computer Science) by Wolfgang Reisig on page 385
- Reliable Distributed Systems: Technologies, Web Services, and Applications by Kenneth Paul Birman in Back Matter
- Theory of Computation (Texts in Computer Science) by Dexter C. Kozen in Back Matter
See all 25 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
