On concurrent programming
Our rough guess is there are 118,250 words in this book.
At a pace averaging 250 words per minute, this book will take 7 hours and 53 minutes to read. With a half hour per day, this will take 16 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Word Count
118,250 words, Guess
Page Count
473 pages
Identifiers
- Open LibraryOL655958M
- ISBN-100387949429
- OCLC Control Number36181129
- OCLC Control Numbereuropeanjournalo00amst
- Library of Congress Control Number97001017
and 2 more
- LibraryThing276566
- Goodreads2169553
Classifications
- DDC005.2/75
- LCCQA76.642 .S36 1997
Description
Much software today is structured as concurrent programs. This graduate-level text offers a self-contained and in-depth treatment of the subject. Formal methods and assertional reasoning drive the exposition. Not only are derivation and reasoning about concurrent programs discussed, but the assertional approach provides a compelling way to motivate and understand the more traditional concerns in concurrent programming: synchronization and communication mechanisms; protocols to solve key concurrent programming problems. As befits an introductory text, readers are provided with a good account of the basics: propositional and predicate logic, temporal logic, and a Hoare-style logic for sequential programs. Exercises at the end of each chapter extend and illustrate the main themes. The result is a book that should be invaluable to those interested in concurrent programming.
Subjects
Series Statement
- Graduate texts in computer science
Other Editions
- On concurrent programming
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!