Probabilistic invariants for probabilistic machines

DOI10.1007/3-540-44880-2_16MaRDI QIDQ4436971zbMATH OpenFDO

Authors Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan

Publication date 4 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2651/26510240.htm

zbMATH Keywords

generalised substitutionsprobabilistic algorithmsProbabilityprogram correctnessthe B Methodweakest preconditions

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Probabilistic termination in B
• A probabilistic extension of UML-B
• ZB 2005: Formal Specification and Development in Z and B
• Tank monitoring: A pAMN case study
• Probabilistic Choice, Reversibility, Loops, and Miracles

Cited in

(9)

• Probabilistic guarded commands mechanized in HOL
• Probabilistic termination in B
• Synthesizing Probabilistic Invariants via Doob’s Decomposition
• ZB 2005: Formal Specification and Development in Z and B
• ZB 2005: Formal Specification and Development in Z and B
• Moment-based invariants for probabilistic loops with non-polynomial assignments
• A probabilistic extension of UML-B
• Generating counterexamples for quantitative safety specifications in probabilistic B
• Tank monitoring: A pAMN case study

This page was built for publication: Probabilistic invariants for probabilistic machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436971)