Abstraction, Refinement and Proof for Probabilistic Systems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
- Reasoning about faulty quantum programs
- A UTP approach for rTiMo
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
- Approximate counting in SMT and value estimation for probabilistic programs
- Markov chains and Markov decision processes in Isabelle/HOL
- On the hardness of analyzing probabilistic programs
- A temporal logic for proving properties of topologically general executions
- Towards a linear algebra of programming
- Probabilistic verification of Herman's self-stabilisation algorithm
- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Exploring probabilistic bisimulations. I
- A unification of probabilistic choice within a design-based model of reversible computation
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Moment-based analysis of Bayesian network properties
- Generating functions for probabilistic programs
- Formal semantics of a classical-quantum language
- Quantitative logics for equivalence of effectful programs
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Weakest preconditions in fibrations
- Out of control: reducing probabilistic models by control-state elimination
- Automated termination analysis of polynomial probabilistic programs
- Algorithmic probabilistic game semantics. Playing games with automata
- Refinement algebra for probabilistic programs
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- Fifty years of Hoare's logic
- Computing expected runtimes for constant probability programs
- Stepwise refinement of sequence diagrams with soft real-time constraints
- Program algebra for quantitative information flow
- Proof rules for the correctness of quantum programs
- Automated reasoning for probabilistic sequential programs with theorem proving
- Identity-Based Cryptosystems and Quadratic Residuosity
- Probabilistic NetKAT
- Weakest precondition reasoning for expected run-times of probabilistic programs
- Formalising Semantics for Expected Running Time of Probabilistic Programs
- Typed linear algebra for weigthed (probabilistic) automata
- A theory for the semantics of stochastic and non-deterministic continuous systems
- On Abstraction of Probabilistic Systems
- Formalizing probabilistic noninterference
- Semantics of the probabilistic typed lambda calculus. Markov chain semantics, termination behavior, and denotational semantics
- On higher-order probabilistic subrecursion
- ``Keep definition, change category -- a practical approach to state-based system calculi
- How to brew-up a refinement ordering
- Data refinement with probability in mind
- Testing Finitary Probabilistic Processes
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- Understanding probabilistic programs
- Reactive Probabilistic Programs and Refinement Algebra
- Abstraction of Probabilistic Systems
- Probabilistic Choice in Refinement Algebra
- Predicate transformers for extended probability and non-determinism
- Relations into algebras of probabilistic distributions
- Compositional noninterference from first principles
- Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
- scientific article; zbMATH DE number 1400096 (Why is no real title available?)
- On higher-order probabilistic subrecursion
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting
- Weakest preconditions in fibrations
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular
- The sub-additives: a proof theory for probabilistic choice extending linear logic
- Foundations of probabilistic programming
- A trustful monad for axiomatic reasoning with probability and nondeterminism
- Algebra for quantitative information flow
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
- Semantics of probabilistic processes. An operational approach
- Hidden-Markov program algebra with iteration
- Measure transformer semantics for Bayesian machine learning
- Healthiness conditions for predicate transformers
- A debugger for probabilistic programs
- A specification logic for programs in the probabilistic guarded command language
- Foundations for entailment checking in quantitative separation logic
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
- A probability perspective
- Data-Driven Invariant Learning for Probabilistic Programs
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- Does a Program Yield the Right Distribution?
- On Lexicographic Proof Rules for Probabilistic Termination
- Generating counterexamples for quantitative safety specifications in probabilistic B
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- Probabilistic program verification via inductive synthesis of inductive invariants
- Positivity-hardness results on Markov decision processes
- On lexicographic proof rules for probabilistic termination
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
- Quantum weakest preconditions for reasoning about expected runtimes of quantum programs
- Quantum expectation transformers for cost analysis
- Toward automatic verification of quantum programs
- Weighted automata for exact inference in discrete probabilistic programs
- On the inner structure of multirelations
- Quantifier elimination and Craig interpolation: the quantitative way
- Data-driven invariant learning for probabilistic programs
- Quantum weakest preconditions for reasoning about expected runtimes of quantum programs
- Quantitative verification with neural networks
- Probabilistic datatypes
- A novel stochastic game via the quantitative -calculus
- Quantitative verification with neural networks
- Simple types for probabilistic termination
- A Kleene algebra with tests for union bound reasoning about probabilistic programs
- Denotational semantics for probabilistic and concurrent programs
- Probabilistic predicate transformers. II: Partially observable probability
- Transformer Semantics
This page was built for publication: Abstraction, Refinement and Proof for Probabilistic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650346)
