A theory for nondeterminism, parallelism, communication, and concurrency

DOI10.1016/0304-3975(86)90040-XzbMath0601.68022OpenAlexW2065927961MaRDI QIDQ1081296

Manfred Broy

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90040-x

zbMATH Keywords

fixed pointsconcurrent programspartial recursive functionsmultiprogrammingcommunicating systemsOperational semanticsrewriting rulesdata flow semanticsmutually recursive systems of nondeterministic equationsrecursive stream equationsreduction machinesstream processing functions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items

Amorphous computing: examples, mathematics and theory, A fully abstract trace model for dataflow and asynchronous networks, Specification and verification of object-oriented programs using supertype abstraction, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Free choice and contextually permitted actions, Unnamed Item, Specification and verification of concurrent systems by causality and realizability, Extracting total Amb programs from proofs, SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS, Step semantics for ``true concurrency with recursion, Specification and design of shared resource arbitration, Computable concurrent processes, Infinite trace equivalence, Combining angels, demons and miracles in program specifications, Fixpoints for general correctness, Dual unbounded nondeterminacy, recursion, and fixpoints, Revivals, stuckness and the hierarchy of CSP models, A fixed point approach to parallel discrete event simulation, Algebraic specification of reactive systems, A model of concurrency with fair merge and full recursion

Uses Software

• ALGOL 60

Cites Work

• A systematic approach to language constructs for concurrent programs
• Parameter passing in nondeterministic recursive programs
• Transformational semantics for concurrent programs
• A calculus of communicating systems
• A mathematical semantics for a nondeterministic typed lambda-calculus
• LCF considered as a programming language
• Power domains
• Program. construction. International summer school
• The correctness of nondeterministic programs
• A network of microprocessors to execute reduction languages, part II
• Proving termination with multiset orderings
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Alternation
• Stream Processing Functions
• A Powerdomain Construction
• Can programming be liberated from the von Neumann style?
• Communicating sequential processes
• A new implementation technique for applicative languages
• A note on conditional expressions
• Inductive methods for proving properties of programs
• Programming as a Discipline of Mathematical Nature
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item