scientific article; zbMATH DE number 1049043

From MaRDI portal
Publication:4348453





The subject of this book occured in ``Foundation of Computing Series is a comprehensive treatment of control flow notions in programming, developing operational and denotational semantic models for control flow in 27 languages (cluster of language notions). The authors treat both traditional (assignement, iteration, recursion, locality, etc) and modern concepts (process creation, action refinement, parallel objects, etc). They deal with sequential and concurrent languages, with imperative and also logic, object-oriented and functional languages. Both uniform (propositional) and state-based (first-order) languages and also both deterministic and nondeterministic notions are considered. For each of the 27 languages presented, the authors develop its operational semantics, based on the design of an appropriate labeled transition system specification. In the denotational modeling they apply the compositionality principle in mapping language constructs to elements of a mathematical domain, allowing the application of fixed point techniques to handle recursion. All models to be described are based on mathematical entities wich provide a full history of the computation, in contrast with approaches based on deriving input/output function associated with a program. The main motivations for this kind of modelling are: the wish to deal with sequential and concurrent systems in one unified framework, the increased importance of reactive systems, the desire to treat finite and infinite behaviour as equally valid types of computation. This book is structured as follows. Part I presents the fundamental principles, as in the following chapters: 1. Recursion and iteration, 2. Nondeterminacy, 3. Variations. Part II, entitled Linear Models builds on the foundations introduced in Part I. The notions studied here are both of the more classical/sequential kind and of the modern/concurrent type as in chapters: 4. Uniform parallelism, 5. Unbounded nedeterminism, 6. Locality, 7. Nonuniform parallelism, 8. Recursion revisited, 9. Nested resumptions. Part III is entitled ``Models based on domain equations. All domains applied here are of the branching type and the cocepts investigated have to do with parallelism, as the names of chapters show: 10. Domains equations and bisimulation, 11. Branching domains at work, 12. Extensions of nonuniform parallelism, 13. Concurrent object-oriented programming 14. Atomization, Commit and Action refinement. The main purpose of Part IV (the last) is to outline the connections with four of further areas of semantic interest as in chapters: 15. The control flow kernel of logic programming, 16. True concurrency, 17. Full abstractness, 18. Second-order assignment. This book can be used as an advanced text for graduate students and as a reference work for researchers interested in semantics of programming languages, in concurrency theory and in application of topology in CS.




Cited in
(33)








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 Q4348453)