Denotational semantics for probabilistic and concurrent programs
From MaRDI portal
Cites work
- A denotational semantics for SPARC TSO
- A Powerdomain Construction
- A semantics for concurrent separation logic
- Abstraction, refinement and proof for probabilistic systems.
- An assertion-based program logic for probabilistic programs
- An axiomatic basis for computer programming
- Applications of compactness in the Smyth powerdomain of streams
- Axioms for probability and nondeterminism
- Branching Pomsets for Choreographies
- Branching pomsets: design, expressiveness and applications to choreographies
- Category Theory
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
- Concurrent Kleene algebra and its foundations
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Concurrent Kleene algebra with tests and branching automata
- Countable nondeterminism and random assignment
- Counting large numbers of events in small registers
- Distributing probability over non-determinism
- scientific article; zbMATH DE number 6712178 (Why is no real title available?)
- scientific article; zbMATH DE number 3662551 (Why is no real title available?)
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 17816 (Why is no real title available?)
- scientific article; zbMATH DE number 1469900 (Why is no real title available?)
- scientific article; zbMATH DE number 1531379 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- Modeling concurrency with partial orders
- Multisets and distributions
- No-go theorems for distributive laws
- Nondeterminism and probabilistic choice: Obeying the laws
- Power domains
- Presenting convex sets of probability distributions by convex semilattices and unique bases
- Probabilistic -calculus and event structures
- Probabilistic and quantum event structures
- Probabilistic event structures and domains
- Probabilistic models for the guarded command language
- Proving the Correctness of Multiprocess Programs
- Refinement-oriented probability for CSP
- Semantic domains for combining probability and non-determinism
- Termination of Probabilistic Concurrent Program
- The choice coordination problem
- The equational theory of pomsets
- Towards concurrent quantitative separation logic
- Traces, pomsets, fairness and full abstraction for communicating processes
- Verifying probabilistic programs using a Hoare like logic
This page was built for publication: Denotational semantics for probabilistic and concurrent programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310320)