scientific article
From MaRDI portal
Publication:3906397
zbMath0456.68028MaRDI QIDQ3906397
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ Merging regular processes by means of fixed-point theory ⋮ On grainless footprint semantics for shared-memory programs ⋮ About fair asynchrony ⋮ A fixpoint theory for non-monotonic parallelism ⋮ An algebraic theory of fair asynchronous communicating processes ⋮ Specification and top-down design of distributed systems ⋮ Infinite unfair shuffles and associativity ⋮ Fairness, Resources, and Separation ⋮ Deadlock and fairness in morphisms of transition systems ⋮ Parallel constructions of maximal path sets and applications to short superstrings ⋮ Interpretations of recursion under unbounded nondeterminacy ⋮ A methodology for designing proof rules for fair parallel programs ⋮ The \(\mu\)-calculus as an assertion-language for fairness arguments ⋮ A semantics for concurrent separation logic ⋮ Refining multiset transformers ⋮ A fixpoint approach to finite delay and fairness ⋮ Fairness and communication-based semantics for session-typed languages ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics ⋮ Semantics for finite delay ⋮ m-Algebraic lattices in formal concept analysis ⋮ Polarized subtyping ⋮ Refinement concepts formalised in higher order logic ⋮ A continuous semantics for unbounded nondeterminism ⋮ Towards a foundation for semantics in complete metric spaces ⋮ Co-induction in relational semantics ⋮ Fairness and regularity for SCCS processes ⋮ Duality and the completeness of the modal \(\mu\)-calculus ⋮ Computable concurrent processes ⋮ Logical foundations for programming semantics ⋮ Transfer Principles for Reasoning About Concurrent Programs ⋮ A Revisionist History of Concurrent Separation Logic ⋮ Fixing Zeno gaps ⋮ Alternating states for dual nondeterminism in imperative programming ⋮ The algebra of stream processing functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Encoding fairness in a synchronous concurrent program algebra ⋮ On Distributive Fixed-Point Expressions ⋮ Predicative specifications for functional programs describing communicating networks ⋮ Verification of concurrent programs: The automata-theoretic framework ⋮ Constructing the Views Framework ⋮ Semantics of algorithmic languages ⋮ A fully abstract semantics for concurrent constraint programming ⋮ Weak and strong fairness in CCS ⋮ Algebraic specification of reactive systems ⋮ Synchronized shuffles ⋮ On infinite computations in denotational semantics ⋮ A fair calculus of communicating systems ⋮ Refinement of time ⋮ Non-deterministic data types: Models and implementations ⋮ Strong fairness and full abstraction for communicating processes ⋮ Retracing CSP ⋮ A model of concurrency with fair merge and full recursion ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation ⋮ A simple fixpoint argument without the restriction to continuity
