A discipline of multiprogramming. Programming theory for distributed applications
Jayadev Misras ``Discipline of Multiprogramming -- Programming Theory for Distributed Applications wants to contribute theories and design principles to enhance productivity in specification, abstraction and modularization. In Chapter 1 the author introduces his programming model. This model considers a program generally be structured as a set of objects which consists of actions and/or methods. The actions are executed autonomously and the methods are executed when they are called. In Chapter 2 this model is simplified by eliminating the methods altogether, retaining only actions. Hence, objects can no longer communicate through procedure calls, they are required to communicate via shared variables. This simplified model is appropriate for programs where communications among components play a minor role and computations of a single component are or primary interest. Chapter 3 extends the simplified model from Chapter 2 to make it easier to describe process interactions. Additionally, the issue of program composition is adressed in detail. Chapter 4 treats a number of small examples with the goal to show that typical multiprogramming examples from the literature have succinct representations in the authors programming model Seuss. Chapter 5 and 6 consider the program properties safety and progress. Chapter 7 investigates a new class of properties, called maximality. In Chapter 8 a program composition theory is developed. In Chapter 9 the author introduces conditional properties that include closure properties. In Chapter 10 an abstract model of Seuss Programs is developed based on relational calculus. It is shown that each procedure can be regarded as a binary relation over the program states. In Chapter 11, algorithms for implementing Seuss programs on multiprocessor architectures are developed in which the processors communicate using messages. In the logic developed up to this point it is not possible to deduce from earlier specifications how a specific action affects the program state. In the final Chapter 12 a machinery is developed for such specifications. Most chapters have a large number of examples, contain bibliographic notes and a lot of exercises with solutions. The book concludes with an appendix about elementary logic and algebra, a reference list and an index.
- A general technique for proving lock-freedom
- Tournaments for mutual exclusion: verification and concurrent complexity
- UNITY and Büchi automata
- Specification and verification of concurrent programs through refinements
- Computing with multiple discrete flows
- Web Cube
- A distributed resource allocation algorithm for many processes
- Programming methodology
- scientific article; zbMATH DE number 839543 (Why is no real title available?)
- scientific article; zbMATH DE number 1390332 (Why is no real title available?)
- A rewriting-based model checker for the linear temporal logic of rewriting
- Partially ordered knowledge sharing and fractionated systems in the context of other models for distributed computing
- A simple, object-based view of multiprogramming
- Building correct-by-construction systems with formal patterns
- Correctness and concurrent complexity of the black-white bakery algorithm
- Synchronous vs. asynchronous unison
This page was built for publication: A discipline of multiprogramming. Programming theory for distributed applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2738289)
