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