pith. sign in

arxiv: cs/0701195 · v1 · submitted 2007-01-30 · 💻 cs.PL · cs.PF

An Abstract Monte-Carlo Method for the Analysis of Probabilistic Programs

David Monniaux (LIENS) This is my paper
classification 💻 cs.PL cs.PF
keywords abstracttestinganalysisinterpretationmethodprobabilisticprogramsresults
0
0 comments X
read the original abstract

We introduce a new method, combination of random testing and abstract interpretation, for the analysis of programs featuring both probabilistic and non-probabilistic nondeterminism. After introducing "ordinary" testing, we show how to combine testing and abstract interpretation and give formulas linking the precision of the results to the number of iterations. We then discuss complexity and optimization issues and end with some experimental results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Compositional Inference Metaprogramming with Convergence Guarantees

    cs.PL 2019-07 unverdicted novelty 7.0

    Introduces independent subproblem inference and proves asymptotic convergence guarantees for hybrid MCMC algorithms defined via inference metaprogramming.