Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
From MaRDI portal
Publication:6639734
Recommendations
Cites work
- scientific article; zbMATH DE number 3980105 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 517333 (Why is no real title available?)
- scientific article; zbMATH DE number 605917 (Why is no real title available?)
- scientific article; zbMATH DE number 1142322 (Why is no real title available?)
- scientific article; zbMATH DE number 4115933 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- scientific article; zbMATH DE number 2238781 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- A probabilistic PDL
- A probability perspective
- Abstraction, Refinement and Proof for Probabilistic Systems
- An assertion-based program logic for probabilistic programs
- An axiomatic basis for computer programming
- Automated reasoning for probabilistic sequential programs with theorem proving
- Bisimulation through probabilistic testing
- Communicating Sequential Processes. The First 25 Years
- Composition and behaviors of probabilistic I/O automata
- Constructive versions of Tarski's fixed point theorems
- Differential Hoare Logics and Refinement Calculi for Hybrid Systems with Isabelle/HOL
- EasyCrypt: a tutorial
- FDR3 -- a modern refinement checker for CSP
- Formal certification of code-based cryptographic proofs
- Integrated Formal Methods
- Mathematics of Program Construction
- New approaches for almost-sure termination of probabilistic programs
- On the calculus of relations.
- On the hardness of almost-sure termination
- On the hardness of analyzing probabilistic programs
- Predicative programming Part I
- Predicative programming Part II
- Probabilistic communicating processes
- Probabilistic extensions of process algebras.
- Probabilistic guarded commands mechanized in HOL
- Probabilistic models for the guarded command language
- Probabilistic semantics for RoboChart. A weakest completion approach
- Probabilistic termination: soundness, completeness, and compositionality
- Programs are predicates
- Proofs of randomized algorithms in Coq
- Reactive, generative, and stratified models of probabilistic processes
- Reasoning about probabilistic sequential programs
- Refinement-oriented probability for CSP
- Semantics of Probabilistic Programming: A Gentle Introduction
- Semantics of probabilistic programs
- Semantics with applications: an appetizer.
- Specifications, programs, and total correctness
- Term Rewriting and Applications
- Termination Analysis of Probabilistic Programs with Martingales
- Theoretical Aspects of Computing - ICTAC 2004
- Two Notes on Notation
- Type classes and filters for mathematical analysis in Isabelle/HOL
- Unifying heterogeneous state-spaces with lenses
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
- VPHL: a verified partial-correctness logic for probabilistic programs
- Weakest precondition reasoning for expected run-times of probabilistic programs
- Weakest precondition reasoning for expected runtimes of randomized algorithms
This page was built for publication: Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639734)
