Pages that link to "Item:Q4650346"
From MaRDI portal
The following pages link to Abstraction, Refinement and Proof for Probabilistic Systems (Q4650346):
Displaying 50 items.
- ``Keep definition, change category'' -- a practical approach to state-based system calculi (Q299180) (← links)
- Relations into algebras of probabilistic distributions (Q406461) (← links)
- Compositional noninterference from first principles (Q432152) (← links)
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language (Q541217) (← links)
- A probability perspective (Q640292) (← links)
- Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
- Toward automatic verification of quantum programs (Q667515) (← links)
- Modelling web-service uncertainty: the angel/daemon approach (Q826324) (← links)
- Learning probabilistic termination proofs (Q832245) (← links)
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Tank monitoring: A pAMN case study (Q851131) (← links)
- Integrating stochastic reasoning into Event-B development (Q903513) (← links)
- Proofs of randomized algorithms in Coq (Q923886) (← links)
- The shadow knows: refinement and security in sequential programs (Q923889) (← links)
- Using probabilistic Kleene algebra pKA for protocol verification (Q929968) (← links)
- Algebraic reasoning for probabilistic action systems and while-loops (Q938297) (← links)
- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language (Q1023294) (← links)
- Reasoning about faulty quantum programs (Q1031864) (← links)
- A UTP approach for rTiMo (Q1624596) (← links)
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures (Q1679522) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Towards a linear algebra of programming (Q1941862) (← links)
- Probabilistic verification of Herman's self-stabilisation algorithm (Q1941879) (← links)
- Probabilistic may/must testing: retaining probabilities by restricted schedulers (Q1941883) (← links)
- Exploring probabilistic bisimulations. I (Q1941884) (← links)
- A unification of probabilistic choice within a design-based model of reversible computation (Q1941891) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- Generating functions for probabilistic programs (Q2119118) (← links)
- Formal semantics of a classical-quantum language (Q2123052) (← links)
- Quantitative logics for equivalence of effectful programs (Q2133179) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Weakest preconditions in fibrations (Q2133463) (← links)
- Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Refinement algebra for probabilistic programs (Q2268474) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Stepwise refinement of sequence diagrams with soft real-time constraints (Q2353401) (← links)
- Program algebra for quantitative information flow (Q2423771) (← links)
- Proof rules for the correctness of quantum programs (Q2455601) (← links)
- Automated reasoning for probabilistic sequential programs with theorem proving (Q2695373) (← links)
- Identity-Based Cryptosystems and Quadratic Residuosity (Q2798777) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Formalising Semantics for Expected Running Time of Probabilistic Programs (Q2829281) (← links)
