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