An abstract Monte-Carlo method for the analysis of probabilistic programs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 3, 2001, Pages 93-100

  Monniaux, David ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644373836     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.360211     Document Type: Article

References (19)

1. Franois Bourdoncle. Smantiques des Langages Impratifs d'Ordre Suprieur et Interprtation Abstraite. PhD thesis, cole Polytechnique, 1992.
2. Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. J. Logic Prog., 2-3(13):103-179, 1992.
3. Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the Fifth Conference on Principles of Programming Languages. ACM Press, 1978.
4. J.L. Doob. Measure Theory, volume 143 of Graduate Texts in Mathematics. Springer-Verlag, 1994.
5. Jifeng He, K. Seidel, and A. Mclver. Probabilistic models for the guarded command language. Science of Computer Programming, 28(2-3):171-192, April 1997. Formal specifications: foundations, methods, tools and applications (Konstantin, 1995).
6. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58(301):13-30, 1963.
7. Alexander S. Kechris. Classical descriptive set theory. Graduate Texts in Mathematics. Springer-Verlag, New York, 1995.
8. 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.
9. D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328-350, 1981.
10. N. G. Leveson. Software safety: Why, what, and how. Computing Surveys, 18(2):125-163, June 1986.
11. David Monniaux. Abstract interpretation of probabilistic semantics. In Seventh International Static Analysis Symposium (SAS'00), number 1824 in Lecture Notes in Computer Science. Springer-Verlag, 2000. Springer-Verlag.
12. Carroll Morgan, Annabelle McIver, Karen Seidel, and J. W. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617-647, 1996.
13. Simeon Ntafos. On random and partition testing. In Michal Young, editor, ISSTA 98: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis, pages 42-48, 1998.
14. Panel on Statistical Methods in Software Engineering. Statistical Software Engineering. National Academy of Sciences, 1996.
15. G. Ramalingam. Data flow frequency analysis. In Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 267-277, Philadelphia, Pennsylvania, 21-24 May 1996.
16. H. Rogers. Theory of recursive and effective computability. MGH, 1967.
17. Walter Rudin. Real and Complex Analysis. McGraw-Hill, 1966.
18. Galen R. Shorack and Jon A. Wellner. Empirical Processes with Applications to Statistics. Wiley series in probability and mathematical statistics. John Wiley & Sons, 1986.
19. P. Thvenod-Fosse and H. Waeselynck. Statemate applied to statistical software testing pages 99-109. In Proceedings of the 1993 international symposium on Software testing and analysis, pages 99-109. Association for Computer Machinery, June 1993.