Partial correctness for probabilistic demonic programs
From MaRDI portal
Recommendations
- General correctness: A unification of partial and total correctness
- Demonic, angelic and unbounded probabilistic choices in sequential programs
- Reasoning about loops in total and general correctness
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
- Reasoning about probabilistic sequential programs in a probabilistic logic
Cites work
- A probabilistic dynamic logic
- Demonic, angelic and unbounded probabilistic choices in sequential programs
- Domain theory and integration
- scientific article; zbMATH DE number 3980105 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 3380412 (Why is no real title available?)
- Partial correctness for probabilistic demonic programs
- PCF extended with real numbers
- Probabilistic models for the guarded command language
- Programming as a Discipline of Mathematical Nature
- Programs, Recursion and Unbounded Choice
- Semantics of probabilistic programs
- The generalized Riemann integral on locally compact spaces
- Unifying wp and wlp
Cited in
(19)- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
- Semantics of non-deterministic possibility computation
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
- Proof rules for the correctness of quantum programs
- Compiling quantum programs
- Probabilistic guarded commands mechanized in HOL
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- Remarks on testing probabilistic processes
- Data refinement with probability in mind
- Denotational semantics for a probabilistic timed shared-variable language
- Reasoning about loops in total and general correctness
- Predicate transformers for extended probability and non-determinism
- A while program normal form theorem in total correctness
- Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
- Demonic, angelic and unbounded probabilistic choices in sequential programs
- Partial correctness for probabilistic demonic programs
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language
- Topological cones: functional analysis in a \(T_{0}\)-setting
This page was built for publication: Partial correctness for probabilistic demonic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958768)
