scientific article; zbMATH DE number 108539
Adacommunicationsconcurrent programmingLindamessage passingOccamparallel programmingprogramming logicremote procedure callssemaphoresSRsynchronizationTuring Plus
Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10) Theory of programming languages (68N15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)
This book is a university text for a comprehensive course on concurrent programming. Its ``ultimate goal is to make readers ``understand how to construct correct concurrent programs (p. 7). It starts from a short introduction to programming logic as applied to sequential programming (Chapter 1). Then, it introduces notions of concurrency and synchronization, and extends the programming logic to include concurrent execution, interference and freedom from interference (Chapter 2). Both chapters, 1 and 2, form an introduction to the book, i.e., its Part 1. Part 2 (Chapters 3-6) is devoted to concurrent programming with the use of shared memory (variables). It presents various synchronization and concurrent programming abstraction mechanisms, including critical sections, semaphores, conditional critical regions, and monitors. Part 3 (Chapters 7-9) concerns concurrent programming based on communications, i.e., message passing, without shared memory. It presents notions of asynchronous message passing (distributed programming), synchronous message passing (heartbeat algorithms, broadcast algorithms, etc.), remote procedure calls and rendezvous. Part 4 (Chapter 10) is an overview of five concurrent programming languages: Turing Plus, Occam, Ada, SR, Linda, each with an example of a program showing the strength of the language. Chapters 2-9 all have a similar systematic structure. They start from programming notation used for the corresponding kind of concurrent programming. Then, they present its formal semantics and proofs, followed by a number of examples -- problems posed and solved in the given notation. Each of the chapters includes also a section on possible implementations of the notions concerned, historical notes and references, and a variety of exercises. The book has become popular in a number of universities throughout the world because: (a) it is a good text for a concurrent programming course, and (b) it can be accompanied by a freely available implementation of SR -- one of the languages mentioned above, that includes majority of concurrent programming facilities described and explained in the text.
- scientific article; zbMATH DE number 3848584
- scientific article; zbMATH DE number 47171
- scientific article; zbMATH DE number 3958701
- Concurrent Programming
- scientific article; zbMATH DE number 42962
- Nebenläufige Programme
- Concurrent programming: algorithms, principles, and foundations.
- Concurrent programming technologies and techniques
- On concurrent programming
- The semantics of the combination of atomized statements and parallel choice
- Concurrency and knowledge-level communication in agent languages
- Formal verification of a programming logic for a distributed programming language
- A structured approach for developing concurrent programs in Java
- Completed double layer boundary element algorithm in many-body problems for a multi-processor: An implementation on the \(CM-5\)
- Fairness in shared invocation servicing
- Data-race and concurrent-write freedom are undecidable.
- The essence of parallel Algol.
- A minimal property for characterizing deadlock-free programs
- Understanding concurrent systems
- Partial predicate abstraction and counter-example guided refinement
- Bounded model checking of infinite state systems
- A verification framework for agent programming with declarative goals
- Fast and scalable rendezvousing
- Angelic semantics of fine-grained concurrency
- Real-time verification techniques for untimed systems
- scientific article; zbMATH DE number 986405 (Why is no real title available?)
- Concurrent programming: algorithms, principles, and foundations.
- scientific article; zbMATH DE number 3848584 (Why is no real title available?)
- Introduction to concurrency in programming languages.
- Teaching Concurrency Concepts to Freshmen
- scientific article; zbMATH DE number 3924101 (Why is no real title available?)
- scientific article; zbMATH DE number 3958701 (Why is no real title available?)
- scientific article; zbMATH DE number 42962 (Why is no real title available?)
- Concurrent Programming
- scientific article; zbMATH DE number 47171 (Why is no real title available?)
- scientific article; zbMATH DE number 54242 (Why is no real title available?)
- scientific article; zbMATH DE number 108540 (Why is no real title available?)
- scientific article; zbMATH DE number 194148 (Why is no real title available?)
- scientific article; zbMATH DE number 1231564 (Why is no real title available?)
- On concurrent programming
- scientific article; zbMATH DE number 1984238 (Why is no real title available?)
- Combining Predicate Abstraction with Fixpoint Approximations
- Kooperation und Konkurrenz. Nebenläufige, verteilte und echtzeitabhängige Programmsysteme
- The origin of concurrent programming. From semaphores to remote procedure calls
- Using atomic await commands to develop concurrent programs in Java
- scientific article; zbMATH DE number 2111806 (Why is no real title available?)
- scientific article; zbMATH DE number 767454 (Why is no real title available?)
- scientific article; zbMATH DE number 795666 (Why is no real title available?)
- Concurrent Programming in ML
- Transfer Principles for Reasoning About Concurrent Programs
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
- Erlang programming.
- Simulation refinement for concurrency verification
- Simple concurrent garbage collection almost without synchronization
- The need for compositional proof systems: a survey
- Lost in abstraction: monotonicity in multi-threaded programs
- Fine-grained concurrency with separation logic
- Delay-bounded scheduling without delay!
- A semantics for concurrent separation logic
- Resources, concurrency, and local reasoning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024005)