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

DOI10.1145/360204.360211zbMath1323.68219OpenAlexW3101972507MaRDI QIDQ5178876

David Monniaux

Publication date: 17 March 2015

Published in: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/360204.360211

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting ⋮ Statistical Verification of Probabilistic Properties with Unbounded Until ⋮ Evaluating Complex MAC Protocols for Sensor Networks with APMC

This page was built for publication: An abstract Monte-Carlo method for the analysis of probabilistic programs