CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897481
Recommendations
- Refinement algebra for probabilistic programs
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
- Algorithmic probabilistic game semantics. Playing games with automata
- Universal equivalence and majority of probabilistic programs over finite fields
- Verification of Probabilistic Programs
Cited in
(17)- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs
- Universal equivalence and majority of probabilistic programs over finite fields
- On the hardness of analyzing probabilistic programs
- On the termination problem for probabilistic higher-order recursive programs
- Contextual equivalence for probabilistic programs with continuous random variables and scoring
- Three tokens in Herman's algorithm
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Program equivalence in a typed probabilistic call-by-need functional language
- A generalisation of stationary distributions, and probabilistic program algebra
- Refinement algebra for probabilistic programs
- Program verification using symbolic game semantics
- Verifying annotated program families using symbolic game semantics
- Does a Program Yield the Right Distribution?
- Algorithmic probabilistic game semantics. Playing games with automata
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
- scientific article; zbMATH DE number 3960967 (Why is no real title available?)
This page was built for publication: CONCUR 2005 – Concurrency Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897481)
