On concurrent programming (Q4348472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1049169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On concurrent programming |
scientific article; zbMATH DE number 1049169 |
Statements
17 August 1997
0 references
first-order predicate logic
0 references
linear-time temporal logic
0 references
concurrent computations
0 references
0.8350346684455872
0 references
On concurrent programming (English)
0 references
This book is about a self-contained treatment of techniques for developing concurrent and distributed programs. The methods presented are based on first-order predicate logic, linear-time temporal logic and Hoare-style based asserted programs. The book presents notations and programming constructs for describing concurrent computations, including various synchronization mechanisms. In chapters 2 to 4 the author reviews some concepts from formal classical and temporal logic, and gives an axiomatization for the second. In chapter 4 he describes a sequential programming notation and a calculus to aid in deriving a proof outline along with a program, then (chapter 5 ) he adds statements for concurrency and synchronization to these. In chapter 6 an important class of safety properties, invariance, is presented, also the methods for proving that a program satisfies an invariance property. Additional axioms and inferences rules of S-temporal logic are given in chapter 8. Chapter 10 discusses primitives implemented by operating systems for awaiting and signaling conditions, starting with semaphores and loks. Distributed programming and a ``putting it together'' are presented in the last two chapters.
0 references
