Abstract interpretation of programs as Markov decision processes

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

Volumn 2694, Issue , 2003, Pages 237-254

  Monniaux, David ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; ITERATIVE METHODS; MARKOV PROCESSES; MODEL CHECKING; SEMANTICS; STATIC ANALYSIS;

ABSTRACT INTERPRETATIONS; ITERATION METHOD; LINEAR TIME LOGIC; MARKOV DECISION PROCESSES; PROGRAM POINTS; TRANSITION SYSTEM; UPPER BOUND;

TEMPORAL LOGIC;

EID: 23944465285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44898-5_13     Document Type: Article

References (25)

1. Luca de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science, June 1998. CS-TR-98-1601.
2. Christel Baier, Edmund M. Clarke, Vasiliki Hartonas-Garmhausen, and Marta Kwiatkowska. Symbolic model checking for probabilistic processes. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Automata, Languages and Programming (ICALP'97), volume 1256 of LNCS. Springer, 1997.
3. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In FST TCS'95: Foundations of Software Technology and Theoretical Computer Science, volume 1026 of Lecture Notes in Computer Science, pages 499-513. Springer-Verlag, 1995.
4. 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.
5. Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Model Checking. MIT Press, 1999.
6. Rance Cleaveland, Scott A. Smolka, and Amy E. Zwarico. Testing preorders for probabilistic processes. In Werner Kuich, editor, Automata, Languages and Programming, 19th International Colloquium, volume 623 of Lecture Notes in Computer Science, pages 708-719, Vienna, Austria, 13-17 July 1992. Springer-Verlag.
7. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. In Proc. ICALP'90, volume 443 of LNCS, pages 336-349. Springer, 1990.
8. Patrick 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.
9. Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. J. Logic Prog., 2-3(13):103-179, 1992.
10. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. In STOC'01, 33rd Annual ACM Symposium on Theory of Computing. ACM, 2001.
11. Hans Hansson and Bengt Jonsson. A logic for reasoning about time and reability. Technical Report R90-13, Swedish Institute of Computer Science, December 1990.
12. Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, and Jeremy Sproston. Verifying quantitative properties of continuous probabilistic timed automata. Technical Report CSR-00-6, University of Birmingham, School of Computer Science, March 2000.
13. Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, and Jeremy Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In C. Palamidessi, editor, CONCUR 2000 - Concurrency Theory 11th International Conference, number 1877 in LNCS. Springer, 2000.
14. Michael L. Littman, Anthony R. Cassandra, and Leslie Pack Kaelbling. Efficient dynamic-programming updates in partially observable markov decision processes. Technical Report CS-95-19, Brown University, 1995.
15. A. McIver. Reasoning about efficiency within a probabilistic μ-calculus. In Proc. of PROBMIV, pages 45-58, 1998. Technical Report CSR-98-4, University of Birmingham, School of Computer Science.
16. David Monniaux. Abstract interpretation of probabilistic semantics. In Seventh International Static Analysis Symposium (SAS'00), number 1824 in Lecture Notes in Computer Science, pages 322-339. Springer Verlag, 2000. Extended version on the author's web site.
17. David Monniaux. An abstract analysis of the probabilistic termination of programs. In 8th International Static Analysis Symposium (SAS'01), number 2126 in Lecture Notes in Computer Science, pages 111-126. Springer Verlag, 2001.
18. David Monniaux. An abstract Monte-Carlo method for the analysis of probabilistic programs (extended abstract). In 28th Symposium on Principles of Programming Languages (POPL'01), pages 93-101. Association for Computer Machinery, 2001.
19. David Monniaux. Backwards abstract interpretation of probabilistic programs. In European Symposium on Programming Languages and Systems (ESOP'01), number 2028 in Lecture Notes in Computer Science, pages 367-382. Springer Verlag, 2001.
20. David Monniaux. Abstraction of expectation functions using gaussian distributions. In Lenore D. Zuck, Paul C. Attie, Agostino Cortesi, and Supratik Mukhopadhyay, editors, Verification, Model Checking, and Abstract Interpretation: VMCAI'03, number 2575 in Lecture Notes in Computer Science, pages 161-173. Springer Verlag, 2003.
21. Jacques Neveu. Mathematical Foundations of the Calculus of Probabilities. Holden-Day, 1965.
22. Jacques Neveu. Bases mathématiques du calcul des probabilités. Massen et Cie, Editeurs, Paris, 1970. Préface de R. Fortet. Deuxième édition, revue et corrigée.
23. Martin L. Puterman. Markov decision processes: Discrete stochastic dynamic programming. Wiley series in probability and mathematical statistics. John Wiley & Sons, 1994.
24. Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995. Technical report MIT/LCS/TR-676.
25. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, pages 135-191. Elsevier, 1990.