scientific article; zbMATH DE number 1049043
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.
- Fully abstract models and refinements as tools to compare agents in timed coordination languages
- Continuation semantics for flowgraph equations
- Structural induction and coinduction in a fibrational setting
- Fundamentals of control flow in workflows
- ConGolog, a concurrent programming language based on the situation calculus
- New perspectives of granular computing in relation geometry induced by pairings
- A note on distances between probabilistic and quantum distributions
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Widening for Control-Flow
- Continuation passing semantics for membrane systems
- Equational presentations of functors and monads
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- Supporting control definition in programming languages
- Process of petri nets extension
- A quasi-metric computational model from modular functions on monoids
- scientific article; zbMATH DE number 3967883 (Why is no real title available?)
- A relational realizability model for higher-order stateful ADTs
- scientific article; zbMATH DE number 1497789 (Why is no real title available?)
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Extending set functors to generalised metric spaces
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Proceedings of the first workshop on control operators and their semantics, COS 2013, Eindhoven, The Netherlands, June 24--25, 2013
- Distances between states and between predicates
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Denotational semantics for programming languages, balanced quasi-metrics and fixed points
- On the structure of the space of complexity partial functions
- Topological models for higher order control flow
- Variants of spiking neural P systems and their operational semantics in Haskell
- Spiking neural P systems and their semantics in Haskell
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
- Drawing with distance
- Stone coalgebras
- Process algebra and constraint programming for modeling interactions in MAS
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)