Principles of Concurrent and Distributed Programming

See author proposal above for provisional T.O.C.

Autorentext
Mordechai (Moti) Ben-Ari is an Associate Professor in the Department of Science Teaching at the Weizmann Institute of Science in Rehovot, Israel.  He is the author of texts on Ada, concurrent programming, programming languages, and mathematical logic, as well as Just a Theory: Exploring the Nature of Science.  In 2004 he was honored with the ACM/SIGCSE Award for Outstanding Contribution to Computer Science Education.

Klappentext
Final Cover Copy Ben-Ari   Principles of Concurrent and Distributed Programming 2nd Edition   M. Ben-Ari   The latest edition of a classic text from a winner of the ACM/SIGCSE Award for Outstanding Contribution to Computer Science Education.           Software today is inherently concurrent or distributed from event-based GUI designs to operating and real-time systems to Internet applications. The new edition of this classic introduction to concurrency has been completely revised in view of the growing importance of concurrency constructs embedded in programming languages and of formal methods such as model checking that are widely used in industry.   The 2nd edition:   Ø     Focuses on algorithmic principles rather than language syntax; Ø     Emphasizes the use of the Spin model checker for modeling concurrent systems and verifying program correctness; Ø     Explains the implementation of concurrency in the Java and Ada languages. Ø     Facilitates lab work with software tools for learning concurrent and distributed programming.   Check out the companion website for the book at www.pearson.co.uk/ben-ari  to find additional resources for both students and instructors, including source code in various languages for the programs in the book, answers to the exercises, and slides for all diagrams, algorithms and programs.   About the Author   Mordechai (Moti) Ben-Ari is an Associate Professor in the Department of Science Teaching at the Weizmann Institute of Science in Rehovot, Israel.  He is the author of texts on Ada, concurrent programming, programming languages, and mathematical logic, as well as Just a Theory: Exploring the Nature of Science.  In 2004 he was honored with the ACM/SIGCSE Award for Outstanding Contribution to Computer Science Education.  

Zusammenfassung
From a winner of the ACM/SIGCSE Award, this introduction to concurrency takes into account the importance of concurrency constructs in programming languages and of formal methods such as model checking. It focuses on algorithmic principles, and the use of the Spin model checker for modeling concurrent systems and verifying program correctness.

Inhalt
Contents Preface xi 1 What is Concurrent Programming? 11.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.2 Concurrency as abstract parallelism . . . . . . . . . . . . . . . . 21.3 Multitasking . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41.4 The terminology of concurrency . . . . . . . . . . . . . . . . . 41.5 Multiple computers . . . . . . . . . . . . . . . . . . . . . . . . 51.6 The challenge of concurrent programming . . . . . . . . . . . . 5 2 The Concurrent Programming Abstraction 72.1 The role of abstraction . . . . . . . . . . . . . . . . . . . . . . . 72.2 Concurrent execution as interleaving of atomic statements . . . . 82.3 Justification of the abstraction . . . . . . . . . . . . . . . . . . . 132.4 Arbitrary interleaving . . . . . . . . . . . . . . . . . . . . . . . 172.5 Atomic statements . . . . . . . . . . . . . . . . . . . . . . . . . 192.6 Correctness . . . . . . . . . . . . . . . . . . . . . . . . . . . . 212.7 Fairness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 232.8 Machine-code instructions . . . . . . . . . . . . . . . . . . . . . 242.9 Volatile and non-atomic variables . . . . . . . . . . . . . . . . . 282.10 The BACI concurrency simulator . . . . . . . . . . . . . . . . . 292.11 Concurrency in Ada . . . . . . . . . . . . . . . . . . . . . . . . 312.12 Concurrency in Java . . . . . . . . . . . . . . . . . . . . . . . . 342.13 Writing concurrent programs in Promela . . . . . . . . . . . . . 362.14 Supplement: the state diagram for the frog puzzle . . . . . . . . 37 3 The Critical Section Problem 453.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453.2 The definition of the problem . . . . . . . . . . . . . . . . . . . 453.3 First attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483.4 Proving correctness with state diagrams . . . . . . . . . . . . . . 493.5 Correctness of the first attempt . . . . . . . . . . . . . . . . . . 533.6 Second attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . 553.7 Third attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . 573.8 Fourth attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . 583.9 Dekker’s algorithm . . . . . . . . . . . . . . . . . . . . . . . . 603.10 Complex atomic statements . . . . . . . . . . . . . . . . . . . . 61 4 Verification of Concurrent Programs 674.1 Logical specification of correctness properties . . . . . . . . . . 684.2 Inductive proofs of invariants . . . . . . . . . . . . . . . . . . . 694.3 Basic concepts of temporal logic . . . . . . . . . . . . . . . . . 724.4 Advanced concepts of temporal logic . . . . . . . . . . . . . . . 754.5 A deductive proof of Dekker’s algorithm . . . . . . . . . . . . . 794.6 Model checking . . . . . . . . . . . . . . . . . . . . . . . . . . 834.7 Spin and the Promela modeling language . . . . . . . . . . . . . 834.8 Correctness specifications in Spin . . . . . . . . . . . . . . . . . 864.9 Choosing a verification technique . . . . . . . . . . . . . . . . . 88 5 Advanced Algorithms for the Critical Section Problem 935.1 The bakery algorithm . . . . . . . . . . . . . . . . . . . . . . . 935.2 The bakery algorithm for N processes . . . . . . . . . . . . . . 955.3 Less restrictive models of concurrency . . . . . . . . . . . . . . 965.4 Fast algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . 975.5 Implementations in Promela . . . . . . . . . . . . . . . . . . . . 104

#	Onlineshop	Preis CHF	Versand CHF	Total CHF
1	Seller	0.00	0.00	0.00