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

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 93-101

  Monniaux, D ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; MONTE CARLO METHODS; PROBABILITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SEMANTICS; SOFTWARE ENGINEERING; TURING MACHINES;

ABSTRACT MONTE CARLO METHOD; PROBABILISTIC PROGRAMS; RANDOM TESTING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0035032350     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/360204.360211     Document Type: Conference Paper

References (19)

1. Smantiques des Langages Impratifs d'Ordre Suprieur et Interprtation Abstraite
2. Abstract interpretation and application to logic programs
3. Automatic discovery of linear restraints among variables of a program
4. Probabilistic models for the guarded command language
5. Probability inequalities for sums of bounded random variables
6. Semantics of probabilistic programs
7. Semantics of probabilistic programs
8. Software safety: Why, what, and how
9. Abstract interpretation of probabilistic semantics
10. Refinement-oriented probability for CSP
11. On random and partition testing
12. Panel on statistical methods in software engineering
13. Data flow frequency analysis
14. Statemate applied to statistical software testing pages 99-109