Abstraction of expectation functions using Gaussian distributions

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

Volumn 2575, Issue , 2003, Pages 161-173

  Monniaux, David ^a  

^a LIENS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; SEMANTICS;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; FUNCTION MAPPING; GAUSSIANS; INFINITE STATE; PROGRAM POINTS; UPPER APPROXIMATION;

MODEL CHECKING;

EID: 24344509346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36384-x_15     Document Type: Article

References (16)

1. E. Anderson, Z. Bai, C. Bischof, S. Blackfordand J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK Users' Guide. SIAM, third edition, 1999. On-line extra documentation at http://www.netlib.org/lapack/.
2. J.M. Arnaudiès and H. Fraysse. Cours de mathématiques, 4: Algèbre bilinéaire et géométrie. Dunod Université, 1990.
3. Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. J. Logic Prog., 2-3(13):103-179, 1992.
4. Luca de Alfaro, Marta Kwiatkowska, Gethin Norman, David Parker, and Roberto Segala. Symbolic model checking of probabilistic processes using MTBDDs and the kronecker representation. In TACAS'2000, volume 1785 of Lecture Notes in Computer Science. Springer-Verlag, January 2000.
5. Free Software Foundation. GNU Octave: A high-level interactive language for numerical computations.
6. Michael Huth and Marta Kwiatkowska. On probabilistic model checking. Technical Report CSR-96-15, University of Birmingham, School of Computer Science, August 1996.
7. D. Kozen. Semantics of probabilistic programs. In 20th Annual Symposium on Foundations of Computer Science, pages 101-114, Long Beach, Ca., USA, October 1979. IEEE Computer Society Press.
8. D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328-350, 1981.
9. 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.
10. 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.
11. 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.
12. David Monniaux. Analyse de programmes probabilistes par interprétation abstraite. Thèse de doctorat, Université Paris IX Dauphine, 2001. Résumé étendu en français. Contents in English.
13. 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.
14. Martin L. Puterman. Markov decision processes: discrete stochastic dynamic programming. Wiley series in probability and mathematical statistics. John Wiley & Sons, 1994.
15. Éric Goubault. Static analyses of floating-point operations. In Static Analysis (SAS '01), Lecture Notes in Computer Science. Springer-Verlag, July 2001.
16. J. Vignes and R. Alt. An efficient stochastic method for round-off error analysis. In Accurate scientific computations (Bad Neuenahr, 1985), pages 183-205. Springer, Berlin, 1986.