Reasoning about probabilistic sequential programs in a probabilistic logic
From MaRDI portal
Recommendations
Cited in
(17)- An assertion-based program logic for probabilistic programs
- Partial correctness for probabilistic demonic programs
- \(\pi\)-calculus with noisy channels
- Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence
- Reasoning about Recursive Probabilistic Programs
- Reasoning About States of Probabilistic Sequential Programs
- Domain semantics of possibility computations
- Similarity mass and approximate reasoning
- \(L\)-fuzzy strongest postcondition predicate transformers as \(L\)-idempotent linear or affine operators between semimodules of monotonic predicates
- Predicate transformers for extended probability and non-determinism
- Reasoning about probabilistic sequential programs
- Healthiness conditions for predicate transformers
- Logic Programming and Nonmonotonic Reasoning
- Semantics of non-deterministic possibility computation
- Preprocessing for Optimization of Probabilistic-Logic Models for Sequence Analysis
- Value-passing CCS with noisy channels
- Demonic, angelic and unbounded probabilistic choices in sequential programs
This page was built for publication: Reasoning about probabilistic sequential programs in a probabilistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424351)