Probabilistic invariants for probabilistic machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2651, Issue , 2003, Pages 240-259

  Hoang, Thai Son ^a   Jin, Zhendong ^a   Robinson, Ken ^a   McIver, Annabelle ^b   Morgan, Carroll ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

Generalised substitutions; Probabilistic algorithms; Probability; Program correctness; The B Method (B); Weakest preconditions

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; PROBABILITY;

B METHOD; PROBABILISTIC ALGORITHM; PROBABILISTIC CHOICES; PROBABILISTIC MACHINES; PROBABILISTIC PROGRAMS; PROBABILISTIC PROPERTIES; PROGRAM CORRECTNESS; WEAKEST PRECONDITION;

COMPUTATIONAL LINGUISTICS;

EID: 35248854491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44880-2_16     Document Type: Article

References (14)

1. Probabilistic symbolic model checker. http://www.cs.bham.ac.uk/~dxp/prism/publications.html.
2. Specification and development of probabilistic systems. http://web.comlab.ox.ac.uk/oucl/research/areas/probs/.
3. Proceeding of the 3rd International Conference of B and Z Users. Springer, 2003.
4. J-R. Abrial. The B-Book. Cambridge University Press, 1996.
5. B-Core(UK) Ltd. B Toolkit. http://www.b-core.com.
6. John E. Freund. John E. Freund's Mathematical Statistics. Prentice Hall International, Inc., 6 edition, 1999.
7. D. Gries and J. Prins. A new notion of encapsulation. In Symposium on Language Issues in Programming Environments. SIGPLAN, June 1985.
8. A. K. McIver. Quantitative program logic and counting rounds in probabilistic distributed algorithms. In Proc. 5th Intl. Workshop ARTS '99, volume 1601, 1999.
9. A. K. McIver and C. C. Morgan. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica, 37:329-354, 2001.
10. C. C. Morgan, A. K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.
11. A. K. McIver, C. C. Morgan, and Thai Son Hoang. Probabilistic termination in B. In Proceeding of the 3rd International Conference of B and Z Users [3].
12. C. C. Morgan. Programming from Specifications. Prentice-Hall, second edition, 1994. At web.coralab.ox.ac.uk/oucl/publications/books/PfS.
13. C. C. Morgan. The generalised substitution language extended to probabilistic programs. In Proceedings B'98: the 2nd International B Conference, volume 1393 of LNCS, Montpelier, April 1998. Also available at [2, B98].
14. Stoelinga and Vaandrager. Root contention in IEEE 1394. In Proceedings of the 5th AMAST workshop on real time and probabilistic systems Bamberg, Germany, ARTS' 1999, volume 1061 of LNCS.