Reasoning about probabilistic sequential programs in a probabilistic logic

Acta Informatica

Volumn 39, Issue 5, 2003, Pages 315-389

  Ying, Mingsheng ^a,b  

^a TSINGHUA UNIVERSITY   (China)

^b TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

SEQUENTIAL PROGRAMS;

COMPUTER HARDWARE; COMPUTER SOFTWARE; SEMANTICS; THEOREM PROVING;

PROBABILISTIC LOGICS;

EID: 0038240024     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-003-0113-z     Document Type: Review

References (50)

1. S. Abramsky, R. Blute, P. Panangaden. Nuclear and trace ideals in tensor-* categories. Journal of Pure and Applied Algebra 143, 3-47 (1999)
2. R. -J. Back, J. von Wright. A lattice-theoretical basis for a specification language. In: Mathematics of Program Construct, Groningen, the Netherlands, Lecture Notes in Computer Science 375. Springer-Verlag, 1989
3. R. -J. Back, J. von Wright. Duality in specification languages: a lattice-theoretical approach. Acta Informatica 27, 583-625 (1990)
4. R. -J. Back, J. von Wright. Refinement Calculus: A Systematic Introduction. Springer-Verlag, New York 1998
5. J. Baeten, J. A. Bergstra, S. A. Smolka. Axiomatizing probabilistic processes: ACP with generative probability. Information and Computation 122, 234-255 (1995)
6. J. A. Bergstra, J. -W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science 33, 77-121 (1985)
7. R. Carnap. Logical Foundations of Probability. University of Chicago Press, Chicago 1950
8. P. Cousot, R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, CA, pp. 238-252, 1977
9. L. de Alfaro, R. Majumdar. Quantitative solution of omega-regular games. In: Proceedings of the 33th Annual ACM Symposium on Theory of Computing, STOC'01, Hersonissos, Crete, Greece, pp. 675-683, 2001
10. E. D. Dijkstra. Notes on structured programming. In: O. Dahl, E. W. Dijkstra, C. A. R. Hoare (eds.) Structured Programming. Academic Press, New York 1971
11. E. W. Dijkstra. A Discipline of Programming. Prentice Hall, Englewood Cliffs, NJ 1976
12. E. E. Doberkat. The converse of a probabilistic relation. Technical Report 113, University of Dortmund, 2001
13. E. E. Doberkat. The demonic product of probabilistic relations. Technical Report 116, University of Dortmund 2001.
14. J. Y. Halpern. An analysis of first-order logics of probability. Artificial Intelligence 46, 311-350 (1990)
15. J. He, K. Seidel, A. K. McIver. Probabilistic models for the guarded command language. Science of Computer Programming 28, 171-192 (1997)
16. W. H. Hesselink. Command algebras, recursion and program transformation. Formal Aspects of Computing 2, 60-104 (1990)
17. C. A. R. Hoare. Communicating sequential processes. Communications of the ACM 21, 666-677 (1978)
18. C. Jones. Probabilistic nondeterminism. Ph. D. thesis, Monograph ECS-LFCS-90-105, Edinburgh University, UK 1990
19. C. Jones, G. Plotkin. A probabilistic powerdomain of evalutions. In: Proceeding of the 4th IEEE Annual Symposium on Logic in Computer Science, pp. 186-195. Los Alamitos, California 1989
20. D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Science 22, 328-350 (1981)
21. D. Kozen. A probabilistic PDL. In: Proceedings of the 15th ACM Symposium on Theory of Computing, New York 1983
22. S. MacLane. Categories for the Working Mathematician. Springer, New York 1971
23. A. K. McIver, C. Morgan. Probabilistic power domains. Technical Report, Programming Research Group, Oxford University Computing Laboratory 1995
24. A. K. McIver, C. Morgan. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica 37, 329-354 (2001)
25. A. K. McIver, C. Morgan. Partial correctness for probabilistic demonic programs. Theoretical Computer Science 266, 513-541 (2001)
26. A. K. McIver, C. Morgan. Games, probability and the quantitative mu-calculus. In: M. Bazz, A. Voronkov (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, pp. 292-310. 9th International Conference, LPAR'02. LNAI 2514, 2002
27. R. Milner. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ 1989
28. C. C. Morgan. Programming from Specifications. Prentice-Hall 1990
29. C. Morgan, A. McIver, K. Seidel. Probabilistic predicate transformers. ACM Trans. Programming Languages and Systems 18, 325-353 (1996)
30. D. Monniaux. Abstract interpretation of probabilistic semantics. In: 7th International Static Analysis Symposium, SAS'00, LNCS 1824, Springer 2000
31. D. Monniaux. An abstract analysis of the probabilistic termination of programs. In: Static Analysis, 8th International Symposium, pp. 111-126. SAS'01, Paris, France, Proceedings, LNCS 2126, Springer 2001
32. N. Nilsson. Probabilistic logic. Artificial Intelligence 28, 71-88 (1986)
33. P. Panangaden. Probabilistic relations. In: C. Baier, M. Huth, M. Kwiatkowska, M. Ryan (eds.) PROBMIV'98, pp. 59-74. 1998
34. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan-Kaufmann 1988
35. G. D. Plotkin. A Structured Approach to Operational Semantics. Report DAIMIFN-19, Aarhus University 1981
36. T. Raghavan, J. Filar. Algorithms for stochastic games - a survey. ZOR - Methods and Models of Operational Research 35, 437-472 (1991)
37. H. Reichenbach. Wahrscheinlichkeitslogik. Erkenntnis 5, 37-43 (1835-36)
38. N. Rescher. Many-Valued Logic. McGraw-Hill, New York 1969
39. K. Seidel. Probabilistic communicating processes. Theoretical Computer Science 152, 219-249 (1995)
40. L. Shapley. Stochastic games. Proc. Nat. Acad. Sci. USA 39, 1195-1100 (1953)
41. F. van Breugel, J. Worrell. Towards quantitative verification of probabilistic transition systems. In: F. Orejas, P.G. Spirakis, J. van Leeuwen (eds.) Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP), Crete, July 2001, Lecture Notes in Computer Science 2076, Springer-Verlag, pp. 421-432
42. F. van Breugel, J. Worrell. An algorithm for quantitative verification of probabilistic transition systems. In: K.G. Larsen, M. Nielsen (eds.) Proceedings of the 12th International Conference on Concurrency Theory (CONCUR), Aalborg, August 2001, Lecture Notes in Computer Science 2154, Springer-Verlag, pp. 336-350
43. R. J. van Glabbeek, S. A. Smolka, B. Steffen. Reactive, generative, and stratified models of processes. Information and Computation 121, 59-80 (1995)
44. N. Wirth. Program development by stepwise refinement. Communications of the ACM 14, 221-227 (1971)
45. J. von Wright. The lattice of data refinement. Acta Informatica 31, 105-135 (1994)
46. M. S. Ying. Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs. Springer-Verlag, New York 2001
47. M. S. Ying. Bisimulation indexes and their applications. Theoretical Computer Science 275, 1-68 (2002)
48. M. S. Ying. Additive models of probabilistic processes. Theoretical Computer Science 275, 481-519 (2002)
49. M. S. Ying, M. Wirsing. Approximate bisimilarity. In: T. Rus (ed.) Algebraic Methodology and Software Technology, 8th International Conference, AMAST 2000, Iowa City, USA, May 20-27, 2000, Proceeedings, Lecture Notes in Computer Science 1816, Springer-Verlag, pp. 309-321
50. Z. Zawirski. Znaczenie logiki wielowartosciowej dla poznania i zwiqzek jej z rachunkiem prawdopodobienstwa. Przeglad Filozoficzny 37, 393-398 (1934)