Reasoning about efficiency within a probabilistic μ-calculus

Electronic Notes in Theoretical Computer Science

Volumn 22, Issue , 1999, Pages 138-155

  McIver, A K ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Imperative programming; Nondeterminism; Predicate transformers; Probabilistic semantics; Refinement; Time efficiency, complexity; Verification

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; MATHEMATICAL MODELS; PROBABILITY; SEMANTICS; THEOREM PROVING;

IMPERATIVE PROGRAMMING; NONDETERMINISM; PREDICATE TRANSFORMERS; PROBABILISTIC SEMANTICS; REFINEMENT; TIME EFFICIENCIES; VERIFICATION;

MATHEMATICAL TRANSFORMATIONS;

EID: 0009594647     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80600-0     Document Type: Conference Paper

References (20)

1. Bianco A., de Alfaro L. Model checking of probabilistic and nondeterministic systems, Foundations of Software Tech. and Theor. Comp. Sci. LNCS volume 1026. 1995;499-513
2. de Alfaro L. Temporal logics for the specification of performance and reliability. Proceedings of STACS ′97, LNCS volume 1200. 1997
3. Dijkstra E.W. A Discipline of Programming. 1976;Prentice Hall International, Englewood Cliffs, N.J
4. Feller W. An Introduction to Probability Theory and its Applications volume 2. second edition :1971;Wiley
5. Hansson H., Jonsson B. A logic for reasoning about time and probability. Formal Aspects of Computing. 6:(5):1994;512-535
6. Jifeng He, Seidel K., McIver A.K. Probabilistic models for the guarded command language. Science of Computer Programming. 28:(2,3):January 1997;171-192
7. Hehner Eric C.R. The Logic of Programming. 1984;Prentice-Hall International
8. Kozen D. A probabilistic PDL. In Proceedings of the 15th ACM Symposium on Theory of Computing. 1983;ACM, New York
9. Kozen D. Results on the propositional μ-calculus. Theoretical Computer Science. 27:1983;333-354
10. Lynch N., Saias I., Segala R. Proving time bounds for randomized distributed algorithms. Proceedings of 13th Annual Symposium on Principles of Distributed Algorithms. 1994;314-323
11. Huth M., Kwiatkowska M. Quantitative analysis and model checking Proceedings of 12th annual IEEE Symposium on Logic in Computer Science. 1997
12. C. C. Morgan. Proof rules for probabilistic loops. In He Jifeng, John Cooke, and Peter Wallis, editors, Proceedings of the BCSFACS 7th Refinement Workshop, Workshops in Computing Springer Verlag, July 1996. http://www.springer.co.uk/ewic/workshops/7RW.
13. C. C. Morgan and A. K. McIver. The choice-coordination problem: Notes for a correctness proof See DC96 at http[18].
14. C. C. Morgan and A. K. McIver. A temporal logic for probabilistic predicate transformers. See MM97 at http [18].
15. Morgan C.C., McIver A.K., Seidel K. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems. 18:(3):May 1996;325-353
16. Carroll Morgan. The generalised substitution language extended to probabilistic programs To appear in B′98: the Second International B Conference See B98 at http [18], April 1998.
17. Morgan Carrol., McIver Annabell. A probabilistic temporal calculus based on expectations. Groves Linsay, Reeves Stev. Proceedings of Formal Methods Pacific ′97. July 1997;Springer Verlag. See also PTL96 at http [18]
18. PSG Probabilistic Systems Group: Collected reports. http://www.comlab.ox. ac.uk/oucl/groups/probs/bibliography.html
19. Rabin M.O. The choice-coordination problem. Acta Informatica. 17:(2):June 1982;121-134
20. Sharir M, Pnueli A., Hart S. Verification of probabilistic programs. SIAM Journal on Computing. 13:(2):May 1984;292-314