Quantitative program logic and performance in probabilistic distributed algorithms

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

Volumn 1601, Issue , 1999, Pages 19-33

  McIver, Annabelle K ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORMAL METHODS; PHILOSOPHICAL ASPECTS; REAL TIME SYSTEMS;

DINING PHILOSOPHERS; FORMAL FRAMEWORK; LOCAL PROPERTY; NON-DETERMINISM; PROGRAM ANALYSIS; PROGRAM LOGIC;

COMPUTER CIRCUITS;

EID: 0038419874     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48778-6_2     Document Type: Conference Paper

References (20)

1. M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20:207-226, 1983.
2. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Mass., 1988.
3. L. de Alfaro. Temporal logics for the specification of performance and reliability. Proceedings of STACS '97, LNCS volume 1200, 1997.
4. E.W. Dijkstra. A Discipline of Programming. Prentice Hall International, Englewood Cliffs, N.J., 1976.
5. W. Feller. An Introduction to Probability Theory and its Applications, volume 1. Wiley, second edition, 1971.
6. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512-535, 1994.
7. Jifeng He, K.Seidel, and A. K. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28(2,3):171-192, January 1997.
8. D. Kozen. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing, New York, 1983. ACM.
9. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
10. D. Lehmann and M. O. Rabin. On the advantages of free choice: a symmetric and fully-distributed solution to the Dining Philosophers Problem. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, pages 133-138, New York, 1981. ACM.
11. N. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. Proceedings of 13th Annual Symposium on Principles of Distributed Algorithms, pages 314-323, 1994.
12. A.K. McIver. Quantitative program logic and efficiency in probabilistic distributed algorithms. Technical report. See QLE98 at http [18].
13. A.K. McIver. Reasoning about efficiency within a probabilistic mu-calculus. 1998. Submitted to pre-LICS98 workshop on Probabilistic Methods in Verification.
14. 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.
15. Carroll Morgan. The generalised substitution language extended to probabilistic programs. In Proceedings of B'98: the Second International B Conference. See B98 at http [18], number 1397 in LNCS. Springer Verlag, April 1998.
16. Carroll Morgan and Annabelle McIver. A probabilistic temporal calculus based on expectations. In Lindsay Groves and Steve Reeves, editors, Proc. Formal Methods Pacific '97. Springer Verlag Singapore, July 1997. Available at [18].
17. C.C. Morgan and A.K. McIver. Correctness proof for the randomised dining philosophers. See RDP96 at http [18].
18. PSG. Probabilistic Systems Group: Collected reports. http://www.comlab.ox.ac.uk/oucl/groups/probs/bibliography.html.
19. M. Sharir, A. Pnueli, and S. Hart. Verification of probabilistic programs. SIAM Journal on Computing, 13(2):292-314, May 1984.
20. P. Whittle. Probability via expectations. Wiley, second edition, 1980.