The generalised substitution language extended to probabilistie programs

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

Volumn 1393, Issue , 1998, Pages 9-25

  Morgan, Carroll ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

B; Generalised substitutions; GSL; Probability; Program correctness; Weakest preconditions

Indexed keywords

ARTIFICIAL INTELLIGENCE; BORON; COMPUTER SCIENCE; COMPUTERS; PROBABILITY;

BOOLEAN FORMULAE; PROBABILISTIC CHOICES; PROGRAM CORRECTNESS; RANDOM ALGORITHMS; SMOOTH EXTENSION; WEAKEST PRECONDITION;

BOOLEAN ALGEBRA;

EID: 22144458685     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053351     Document Type: Conference Paper

References (20)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. E.W. Dijkstra. A Discipline of Programming. Prentice Hall International, Englewood Cliffs, N.J., 1976.
3. Yishai A. Feldman. A decidable prepositional dynamic logic with explicit probabilities. Information and Control, 63:11-38, 1984.
4. Yishai A. Feldman and David Harel. A probabilistic dynamic logic. J. Computing and System Sciences, 28:193-215, 1984.
5. Jifeng He, K. Seidel, and A. K. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28:171-192, 1997.
6. C. Jones. Probabilistic nondeterminism. Monograph ECS-LFCS-90-105, Edinburgh Univ. Edinburgh, U.K., 1990. (PhD Thesis).
7. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In Proceedings of the IEEE 4th Annual Symposium on Logic in Computer Science, pages 186-195, Los Alamitos, Calif., 1989. Computer Society Press.
8. D. Kozen. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing, New York, 1983. ACM.
9. Annabelle McIver and Carroll Morgan. Probabilistic predicate transformers: part 2. Technical Report PRG-TR-5-96, Programming Research Group, March 1996. Revised version to be submitted for publication under the title Demonic, angelic and unbounded probabilistic choices in sequential programs.
10. Annabelle McIver and Carroll Morgan. Partial correctness for probabilistic demonic programs. Technical Report PRG-TR-35-97, Programming Research Group, 1997.
11. Annabelle McIver, Carroll Morgan, and Elena Troubitsyna. The probabilistic steam boiler: a case study in probabilistic data refinement. In preparation, 1997.
12. C. C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3), July 1988. Reprinted in [14].
13. C. C. Morgan. Proof rules for probabilistic loops. In He Jifeng, John Cooke, and Peter Wallis, editors, Proceedings of the BCS-FACS 7th Refinement Workshop, Workshops in Computing. Springer Verlag, July 1996.
14. C. C. Morgan and T. N. Vickers, editors. On the Refinement Calculus. FACIT Series in Computer Science. Springer-Verlag, Berlin, 1994.
15. Carroll Morgan, Annabelle McIver, and Karen Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.
16. J. M. Morris. A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming, 9(3):287-306, December 1987.
17. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
18. G. Nelson. A generalization of Dijkstra’s calculus. ACM Transactions on Programming Languages and Systems, 11(4):517-561, October 1989.
19. K. Seidel, C. C. Morgan, and A. K. McIver. An introduction to probabilistic predicate transformers. Technical Report PRG-TR-6-96, Programming Research Group, February 1996. Revised version to be submitted for publication under the title Probabilistic Imperative Programming: a Rigorous Approach.
20. M. Sharir, A. Pnueli, and S. Hart. Verification of probabilistic programs. SIAM Journal on Computing, 13(2):292-314, May 1984.