Pages that link to "Item:Q4650346"
From MaRDI portal
The following pages link to Abstraction, Refinement and Proof for Probabilistic Systems (Q4650346):
Displaying 19 items.
- Typed Linear Algebra for Weigthed (Probabilistic) Automata (Q2914693) (← links)
- A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems (Q2937731) (← links)
- Formalizing Probabilistic Noninterference (Q2938053) (← links)
- On Higher-Order Probabilistic Subrecursion (Q2988381) (← links)
- How to Brew-up a Refinement Ordering (Q2994493) (← links)
- Data Refinement with Probability in Mind (Q2994495) (← links)
- Testing Finitary Probabilistic Processes (Q3184679) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- Understanding Probabilistic Programs (Q3449623) (← links)
- Probabilistic Choice in Refinement Algebra (Q3521991) (← links)
- Predicate transformers for extended probability and non-determinism (Q3636909) (← links)
- (Q5028447) (← links)
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting (Q5039530) (← links)
- Weakest preconditions in fibrations (Q5058365) (← links)
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular (Q5079754) (← links)
- (Q5089025) (← links)
- A trustful monad for axiomatic reasoning with probability and nondeterminism (Q5152658) (← links)
- Healthiness conditions for predicate transformers (Q5971403) (← links)
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism (Q6201390) (← links)
