scientific article; zbMATH DE number 3714908

Cited in

(59)

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

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)