Reasoning about probabilistic sequential programs

Theoretical Computer Science

Volumn 379, Issue 1-2, 2007, Pages 142-165

  Chadha, R ^b   Cruz Filipe, L ^a   Mateus, P ^a   Sernadas, A ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Completeness; Decidability; Hoare calculus; Probabilistic reasoning

Indexed keywords

CASE BASED REASONING; COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS); ITERATIVE METHODS; PROBABILISTIC LOGICS;

COMPLETENESS; HOARE CALCULUS; PROBABILISTIC REASONING;

COMPUTER PROGRAMMING;

EID: 34248206760     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.040     Document Type: Article

References (33)

1. Abadi M., and Halpern J.Y. Decidability and expressiveness for first-order logics of probability. Information and Computation 112 1 (1994) 1-36
2. Ambainis A., Mosca M., Tapp A., and de Wolf R. Private quantum channels. FOCS'00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (2000), IEEE Computer Society 547
3. Baltazar P., Chadha R., Mateus P., and Sernadas A. Towards model-checking quantum security protocols. In: Dini P., et al. (Ed). Proceedings of the First Workshop on Quantum Security: QSec'07 (2007), IEEE Press e-page 0014. Joint e-proceedings with Quantum, Nano, and Micro Technologies: ICQNM '07
4. Basu S., Pollack R., and Marie-Françoise R. Algorithms in Real Algebraic Geometry (2003), Springer Verlag
5. Ben-Or M., Kozen D., and Reif J. The complexity of elementary algebra and geometry. Journal of Computer and System Sciences 18 (1986) 251-264
6. Caleiro C., Mateus P., Sernadas A., and Sernadas C. Quantum institutions. In: Futatsugi K., Jouannaud J.-P., and Meseguer J. (Eds). Algebra, Meaning, and Computation - Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday. Lecture Notes in Computer Science vol. 4060 (2006), Springer Verlag 50-64
7. Chadha R., Mateus P., and Sernadas A. Reasoning about quantum imperative programs. Electronic Notes in Theoretical Computer Science 158 (2006) 19-40 Invited talk at the Twenty-second Conference on the Mathematical Foundations of Programming Semantics
8. Chadha R., Mateus P., and Sernadas A. Reasoning about states of probabilistic sequential programs. In: Ésik Z. (Ed). Computer Science Logic 2006 (CSL06). Lecture Notes in Computer Science vol. 4207 (2006), Springer-Verlag 240-255
9. R. Chadha, P. Mateus, A. Sernadas, C. Sernadas, Extending classical logic for reasoning about quantum systems, CLC, Department of Mathematics, Instituto Superior Técnico, 2005. Invited submission to the Handbook of Quantum Logic. Preprint
10. den Hartog J.I., and de Vink E.P. Verifying probabilistic programs using a Hoare like logic. International Journal of Foundations of Computer Science 13 3 (2002) 315-340
11. Fagin R., Halpern J.Y., and Megiddo N. A logic for reasoning about probabilities. Information and Computation 87 1-2 (1990) 78-128
12. Feldman Y.A. A decidable propositional dynamic logic with explicit probabilities. Information and Control 63 1-2 (1984) 11-38
13. Feldman Y.A., and Harel D. A probabilistic dynamic logic. Journal of Computer and System Sciences 28 (1984) 193-215
14. Hansson H., and Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing 6 (1995) 512-535
15. Hoare C. An axiomatic basis for computer programming. Communications of the ACM 12 (1969) 576-583
16. Hodges W. Model Theory (1993), Cambridge University Press
17. M. Huth, M. Kwiatkowska, Quantitative analysis and model checking, in: 12th Annual IEEE Symposium on Logic in Computer Science, LICS'97, 1997, pp. 111-122
18. C. Jones, Probabilistic non-determinism, Ph.D. Thesis, U. Edinburgh, 1990
19. Jones C., and Plotkin G.D. A probabilistic powerdomain of evaluations. Proceedings of the Fourth Annual Symposium on Logic in Computer Science (1989), IEEE Computer Society 186-195
20. Kozen D. Semantics of probabilistic programs. Journal of Computer System Science 22 (1981) 328-350
21. Kozen D. A probabilistic PDL. Journal of Computer System Science 30 (1985) 162-178
22. J.A. Makowsky, M.L. Tiomkin, Probabilistic propositional dynamic logic, 1980. Manuscript
23. Mateus P., and Sernadas A. Weakly complete axiomatization of exogenous quantum propositional logic. Information and Computation 204 5 (2006) 771-794. ArXiv math.LO/0503453
24. Mateus P., Sernadas A., and Sernadas C. Exogenous semantics approach to enriching logics. In: Sica G. (Ed). Essays on the Foundations of Mathematics and Logic. Advanced Studies in Mathematics and Logic vol. 1 (2005), Polimetrica 165-194
25. Morgan C., McIver A., and Seidel K. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18 3 (1996) 325-353
26. Moshier M.A., and Jung A. A logic for probabilities in semantics. Computer Science Logic. Lecture Notes in Computer Science vol. 2471 (2002), Springer Verlag 216-231
27. Narasimha M., Cleaveland R., and Iyer P. Probabilistic temporal logics via the modal mu-calculus. Foundations of Software Science and Computation Structures. FOSSACS 99. Lecture Notes in Computer Science vol. 1578 (1999), Springer Verlag 288-305
28. Nilsson N.J. Probabilistic logic. Artificial Intelligence 28 1 (1986) 71-87
29. Nilsson N.J. Probabilistic logic revisited. Artificial Intelligence 59 1-2 (1993) 39-42
30. Parikh R., and Mahoney A. A theory of probabilistic programs. Proceedings of the Carnegie Mellon Workshop on Logic of Programs. Lecture Notes in Computer Science vol. 64 (1983), Springer Verlag 396-402
31. L.H. Ramshaw, Formalizing the analysis of algorithms, Ph.D. Thesis, Stanford University, 1979
32. J.H. Reif, Logics for probabilistic programming (extended abstract), in: STOC'80: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, 1980, pp. 8-13
33. Tix R., Keimel K., and Plotkin G.D. Semantic domains for combining probability and non-determinism. Electronic Notes in Theoretical Computer Science 129 (2005) 1-104