Abstract interpretation of programs as Markov decision processes

Science of Computer Programming

Volumn 58, Issue 1-2, 2005, Pages 179-205

  Monniaux, David ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Abstract interpretation; Measure theory; Probabilistic semantics; Probabilities; Program semantics

Indexed keywords

ABSTRACTING; DECISION THEORY; MEASUREMENT THEORY; PROBABILITY; SEMANTICS; SPECIFICATIONS;

ABSTRACT INTERPRETATION; MEASURE THEORY; PROBABILISTIC SEMANTICS; PROBABILITIES; PROGRAM SEMANTICS;

MARKOV PROCESSES;

EID: 24344475591     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2005.02.008     Document Type: Conference Paper

References (33)

1. C. Baier, E.M. Clarke, V. Hartonas-Garmhausen, and M. Kwiatkowska Symbolic model checking for probabilistic processes P. Degano R. Gorrieri A. Marchetti-Spaccamela Automata, Languages and Programming ICALP'97 LNCS vol. 1256 1997 Springer 430 440
2. C. Baier, M. Kwiatkowska, and G. Norman Computing probability bounds for linear time formulas over concurrent probabilistic systems Electronic Notes in Theoretical Computer Science 21 1999
3. A. Bianco, and L. de Alfaro Model checking of probabilistic and nondeterministic systems FST TCS 95: Foundations of Software Technology and Theoretical Computer Science Lecture Notes in Computer Science vol. 1026 1995 Springer-Verlag 499 513
4. E.M. Clarke Jr., O. Grumberg, and D.A. Peled Model Checking 1999 MIT Press
5. R. Cleaveland, S.A. Smolka, and A.E. Zwarico Testing preorders for probabilistic processes W. Kuich Automata, Languages and Programming, 19th International Colloquium 13-17 July 1992, Vienna, Austria Lecture Notes in Computer Science vol. 623 1992 Springer-Verlag 708 719
6. C. Courcoubetis, and M. Yannakakis Markov decision processes and regular events Proc. ICALP'90 LNCS vol. 443 1990 Springer 336 349
7. P. Cousot, Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes, Thèse d'état ès sciences mathématiques, Université scientifique et médicale de Grenoble, Grenoble, France, 21 mars, 1978
8. P. Cousot, and R. Cousot Abstract interpretation and application to logic programs Journal of Logic Programming 2-3 13 1992 103 179
9. P. d'Argenio, B. Jeannet, H. Jensen, and K.G. Larsen Reduction and refinement strategies for probabilistic analysis H. Hermanns R. Segala Process Algebra and Probabilistic Methods: Performance Modeling and Verification 25-26 July 2002 LNCS vol. 2399 2002 Springer 57 76
10. L. de Alfaro, Formal verification of probabilistic systems, Ph.D. Thesis, Stanford University, Department of Computer Science, June 1998, CS-TR-98-1601
11. L. de Alfaro, and R. Majumdar Quantitative solution of omega-regular games 33rd Annual ACM Symposium on Theory of Computing STOC'01 2001 ACM 675 683
12. H. Hansson, B. Jonsson, A logic for reasoning about time and reability, Technical Report R90-13, Swedish Institute of Computer Science, December 1990
13. D. Kozen Semantics of probabilistic programs 20th Annual Symposium on Foundations of Computer Science October 1979, Long Beach, CA, USA 1979 IEEE Computer Society Press 101 114
14. D. Kozen Semantics of probabilistic programs Journal of Computer and System Sciences 22 3 1981 328 350
15. M.Z. Kwiatkowska, G. Norman, R. Segala, J. Sproston, Verifying quantitative properties of continuous probabilistic timed automata, Technical Report CSR-00-6, University of Birmingham, School of Computer Science, March 2000
16. M.Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston Verifying quantitative properties of continuous probabilistic timed automata C. Palamidessi CONCUR 2000-Concurrency Theory 11th International Conference LNCS vol. 1877 2000 Springer 123 137
17. M.L. Littman, A.R. Cassandra, L.P. Kaelbling, Efficient dynamic-programming updates in partially observable markov decision processes, Technical Report CS-95-19, Brown University, 1995
18. A. McIver, Reasoning about efficiency within a probabilistic μ-calculus, in: Proc. of PROBMIV, 1998, pp. 45-58, 1998;
19. Technical Report CSR-98-4, University of Birmingham, School of Computer Science
20. D. Monniaux Abstract interpretation of probabilistic semantics Seventh International Static Analysis Symposium SAS'00 Lecture Notes in Computer Science vol. 1824 2000 Springer Verlag 322 339 (Extended version on the author's web site)
21. D. Monniaux An abstract analysis of the probabilistic termination of programs 8th International Static Analysis Symposium SAS'01 Lecture Notes in Computer Science vol. 2126 2001 Springer Verlag 111 126
22. D. Monniaux An abstract Monte-Carlo method for the analysis of probabilistic programs (extended abstract) 28th Symposium on Principles of Programming Languages POPL'01 2001 Association for Computer Machinery 93 101
23. D. Monniaux, Analyse de programmes probabilistes par interprétation abstraite, Thèse de doctorat, Université Paris IX Dauphine, 2001, Résumé étendu en franais (Contents in English)
24. D. Monniaux Backwards abstract interpretation of probabilistic programs European Symposium on Programming Languages and Systems ESOP'01 Lecture Notes in Computer Science vol. 2028 2001 Springer Verlag 367 382
25. D. Monniaux Abstraction of expectation functions using gaussian distributions L.D. Zuck P.C. Attie A. Cortesi S. Mukhopadhyay Verification, Model Checking, and Abstract Interpretation VMCAI'03 Lecture Notes in Computer Science vol. 2575 2003 Springer Verlag 161 173
26. C. Morgan, A. McIver, K. Seidel, J.W. Sanders, Probabilistic predicate transformers, Technical Report TR-4-95, Oxford University, February 1995
27. J. Neveu, Mathematical Foundations of the Calculus of Probabilities, Holden-Day, 1965
28. J. Neveu, Bases mathématiques du calcul des probabilités, Masson et Cie, Éditeurs, Paris, 1970, Préface de R. Fortet, Deuxième édition, revue et corrigée
29. M.L. Puterman Markov decision processes: discrete stochastic dynamic programming Wiley Series in Probability and Mathematical Statistics 1994 John Wiley & Sons
30. W. Rudin Real and Complex Analysis 1966 McGraw-Hill
31. R. Segala, Modeling and Verification of Randomized Distributed Real-Time Systems, Ph.D. Thesis, Massachusetts Institute of Technology, 1995, Technical Report MIT/LCS/TR-676
32. W. Thomas, Automata on infinite objects, in: van Leeuwen [32], pp. 135-191
33. J. van Leeuwen Handbook of Theoretical Computer Science vol. B 1990 Elsevier